23.82/11.06 YES 23.82/11.06 23.82/11.06 Ultimate: Cannot open display: 23.82/11.06 This is Ultimate 0.1.24-8dc7c08-m 23.82/11.06 [2019-03-28 12:34:30,552 INFO L170 SettingsManager]: Resetting all preferences to default values... 23.82/11.06 [2019-03-28 12:34:30,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 23.82/11.06 [2019-03-28 12:34:30,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 23.82/11.06 [2019-03-28 12:34:30,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 23.82/11.06 [2019-03-28 12:34:30,568 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 23.82/11.06 [2019-03-28 12:34:30,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 23.82/11.06 [2019-03-28 12:34:30,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 23.82/11.06 [2019-03-28 12:34:30,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 23.82/11.06 [2019-03-28 12:34:30,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 23.82/11.06 [2019-03-28 12:34:30,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 23.82/11.06 [2019-03-28 12:34:30,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 23.82/11.06 [2019-03-28 12:34:30,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 23.82/11.06 [2019-03-28 12:34:30,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 23.82/11.06 [2019-03-28 12:34:30,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 23.82/11.06 [2019-03-28 12:34:30,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 23.82/11.06 [2019-03-28 12:34:30,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 23.82/11.06 [2019-03-28 12:34:30,582 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 23.82/11.06 [2019-03-28 12:34:30,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 23.82/11.06 [2019-03-28 12:34:30,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 23.82/11.06 [2019-03-28 12:34:30,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 23.82/11.06 [2019-03-28 12:34:30,588 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 23.82/11.06 [2019-03-28 12:34:30,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 23.82/11.06 [2019-03-28 12:34:30,589 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 23.82/11.06 [2019-03-28 12:34:30,590 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 23.82/11.06 [2019-03-28 12:34:30,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 23.82/11.06 [2019-03-28 12:34:30,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 23.82/11.06 [2019-03-28 12:34:30,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 23.82/11.06 [2019-03-28 12:34:30,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 23.82/11.06 [2019-03-28 12:34:30,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 23.82/11.06 [2019-03-28 12:34:30,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 23.82/11.06 [2019-03-28 12:34:30,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 23.82/11.06 [2019-03-28 12:34:30,596 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 23.82/11.06 [2019-03-28 12:34:30,611 INFO L110 SettingsManager]: Loading preferences was successful 23.82/11.06 [2019-03-28 12:34:30,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 23.82/11.06 [2019-03-28 12:34:30,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 23.82/11.06 [2019-03-28 12:34:30,612 INFO L133 SettingsManager]: * Rewrite not-equals=true 23.82/11.06 [2019-03-28 12:34:30,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 23.82/11.06 [2019-03-28 12:34:30,612 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 23.82/11.06 [2019-03-28 12:34:30,613 INFO L133 SettingsManager]: * Use SBE=true 23.82/11.06 [2019-03-28 12:34:30,613 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 23.82/11.06 [2019-03-28 12:34:30,613 INFO L133 SettingsManager]: * Use old map elimination=false 23.82/11.06 [2019-03-28 12:34:30,613 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 23.82/11.06 [2019-03-28 12:34:30,613 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 23.82/11.06 [2019-03-28 12:34:30,613 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 23.82/11.06 [2019-03-28 12:34:30,614 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 23.82/11.06 [2019-03-28 12:34:30,614 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 23.82/11.06 [2019-03-28 12:34:30,614 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 23.82/11.06 [2019-03-28 12:34:30,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 23.82/11.06 [2019-03-28 12:34:30,614 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 23.82/11.06 [2019-03-28 12:34:30,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE 23.82/11.06 [2019-03-28 12:34:30,615 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 23.82/11.06 [2019-03-28 12:34:30,615 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 23.82/11.06 [2019-03-28 12:34:30,615 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 23.82/11.06 [2019-03-28 12:34:30,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 23.82/11.06 [2019-03-28 12:34:30,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 23.82/11.06 [2019-03-28 12:34:30,616 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 23.82/11.06 [2019-03-28 12:34:30,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 23.82/11.06 [2019-03-28 12:34:30,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 23.82/11.06 [2019-03-28 12:34:30,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 23.82/11.06 [2019-03-28 12:34:30,616 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 23.82/11.06 [2019-03-28 12:34:30,616 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 23.82/11.06 [2019-03-28 12:34:30,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 23.82/11.06 [2019-03-28 12:34:30,657 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 23.82/11.06 [2019-03-28 12:34:30,660 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 23.82/11.06 [2019-03-28 12:34:30,662 INFO L271 PluginConnector]: Initializing CDTParser... 23.82/11.06 [2019-03-28 12:34:30,662 INFO L276 PluginConnector]: CDTParser initialized 23.82/11.06 [2019-03-28 12:34:30,663 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 23.82/11.06 [2019-03-28 12:34:30,728 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9588414d83d84cb1a13d3d88bcef0baf/FLAG6373a3c3b 23.82/11.06 [2019-03-28 12:34:31,086 INFO L307 CDTParser]: Found 1 translation units. 23.82/11.06 [2019-03-28 12:34:31,087 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 23.82/11.06 [2019-03-28 12:34:31,087 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 23.82/11.06 [2019-03-28 12:34:31,094 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9588414d83d84cb1a13d3d88bcef0baf/FLAG6373a3c3b 23.82/11.06 [2019-03-28 12:34:31,487 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9588414d83d84cb1a13d3d88bcef0baf 23.82/11.06 [2019-03-28 12:34:31,499 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 23.82/11.06 [2019-03-28 12:34:31,501 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 23.82/11.06 [2019-03-28 12:34:31,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 23.82/11.06 [2019-03-28 12:34:31,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 23.82/11.06 [2019-03-28 12:34:31,506 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 23.82/11.06 [2019-03-28 12:34:31,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e052b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:31,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 23.82/11.06 [2019-03-28 12:34:31,537 INFO L176 MainTranslator]: Built tables and reachable declarations 23.82/11.06 [2019-03-28 12:34:31,707 INFO L206 PostProcessor]: Analyzing one entry point: main 23.82/11.06 [2019-03-28 12:34:31,721 INFO L191 MainTranslator]: Completed pre-run 23.82/11.06 [2019-03-28 12:34:31,798 INFO L206 PostProcessor]: Analyzing one entry point: main 23.82/11.06 [2019-03-28 12:34:31,815 INFO L195 MainTranslator]: Completed translation 23.82/11.06 [2019-03-28 12:34:31,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31 WrapperNode 23.82/11.06 [2019-03-28 12:34:31,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 23.82/11.06 [2019-03-28 12:34:31,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 23.82/11.06 [2019-03-28 12:34:31,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 23.82/11.06 [2019-03-28 12:34:31,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 23.82/11.06 [2019-03-28 12:34:31,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 23.82/11.06 [2019-03-28 12:34:31,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 23.82/11.06 [2019-03-28 12:34:31,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 23.82/11.06 [2019-03-28 12:34:31,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized 23.82/11.06 [2019-03-28 12:34:31,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 [2019-03-28 12:34:31,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 23.82/11.06 [2019-03-28 12:34:31,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 23.82/11.06 [2019-03-28 12:34:31,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... 23.82/11.06 [2019-03-28 12:34:31,883 INFO L276 PluginConnector]: RCFGBuilder initialized 23.82/11.06 [2019-03-28 12:34:31,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (1/1) ... 23.82/11.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 23.82/11.06 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 23.82/11.06 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 23.82/11.06 [2019-03-28 12:34:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 23.82/11.06 [2019-03-28 12:34:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 23.82/11.06 [2019-03-28 12:34:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 23.82/11.06 [2019-03-28 12:34:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 23.82/11.06 [2019-03-28 12:34:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 23.82/11.06 [2019-03-28 12:34:31,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 23.82/11.06 [2019-03-28 12:34:32,238 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 23.82/11.06 [2019-03-28 12:34:32,239 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 23.82/11.06 [2019-03-28 12:34:32,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:32 BoogieIcfgContainer 23.82/11.06 [2019-03-28 12:34:32,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 23.82/11.06 [2019-03-28 12:34:32,241 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 23.82/11.06 [2019-03-28 12:34:32,241 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 23.82/11.06 [2019-03-28 12:34:32,244 INFO L276 PluginConnector]: BlockEncodingV2 initialized 23.82/11.06 [2019-03-28 12:34:32,245 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:32" (1/1) ... 23.82/11.06 [2019-03-28 12:34:32,267 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 56 edges 23.82/11.06 [2019-03-28 12:34:32,268 INFO L258 BlockEncoder]: Using Remove infeasible edges 23.82/11.06 [2019-03-28 12:34:32,269 INFO L263 BlockEncoder]: Using Maximize final states 23.82/11.06 [2019-03-28 12:34:32,270 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 23.82/11.06 [2019-03-28 12:34:32,270 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 23.82/11.06 [2019-03-28 12:34:32,272 INFO L296 BlockEncoder]: Using Remove sink states 23.82/11.06 [2019-03-28 12:34:32,273 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 23.82/11.06 [2019-03-28 12:34:32,273 INFO L179 BlockEncoder]: Using Rewrite not-equals 23.82/11.06 [2019-03-28 12:34:32,301 INFO L185 BlockEncoder]: Using Use SBE 23.82/11.06 [2019-03-28 12:34:32,335 INFO L200 BlockEncoder]: SBE split 27 edges 23.82/11.06 [2019-03-28 12:34:32,340 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 23.82/11.06 [2019-03-28 12:34:32,342 INFO L71 MaximizeFinalStates]: 0 new accepting states 23.82/11.06 [2019-03-28 12:34:32,376 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 23.82/11.06 [2019-03-28 12:34:32,379 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 23.82/11.06 [2019-03-28 12:34:32,381 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 23.82/11.06 [2019-03-28 12:34:32,381 INFO L71 MaximizeFinalStates]: 0 new accepting states 23.82/11.06 [2019-03-28 12:34:32,381 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 23.82/11.06 [2019-03-28 12:34:32,382 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 23.82/11.06 [2019-03-28 12:34:32,383 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 74 edges 23.82/11.06 [2019-03-28 12:34:32,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:32 BasicIcfg 23.82/11.06 [2019-03-28 12:34:32,383 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 23.82/11.06 [2019-03-28 12:34:32,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 23.82/11.06 [2019-03-28 12:34:32,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... 23.82/11.06 [2019-03-28 12:34:32,388 INFO L276 PluginConnector]: TraceAbstraction initialized 23.82/11.06 [2019-03-28 12:34:32,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:34:31" (1/4) ... 23.82/11.06 [2019-03-28 12:34:32,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30acbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:32, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:32,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (2/4) ... 23.82/11.06 [2019-03-28 12:34:32,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30acbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:32, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:32,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:32" (3/4) ... 23.82/11.06 [2019-03-28 12:34:32,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30acbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:32, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:32,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:32" (4/4) ... 23.82/11.06 [2019-03-28 12:34:32,392 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 23.82/11.06 [2019-03-28 12:34:32,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 23.82/11.06 [2019-03-28 12:34:32,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. 23.82/11.06 [2019-03-28 12:34:32,429 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. 23.82/11.06 [2019-03-28 12:34:32,458 INFO L133 ementStrategyFactory]: Using default assertion order modulation 23.82/11.06 [2019-03-28 12:34:32,459 INFO L382 AbstractCegarLoop]: Interprodecural is true 23.82/11.06 [2019-03-28 12:34:32,459 INFO L383 AbstractCegarLoop]: Hoare is true 23.82/11.06 [2019-03-28 12:34:32,459 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 23.82/11.06 [2019-03-28 12:34:32,460 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 23.82/11.06 [2019-03-28 12:34:32,460 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 23.82/11.06 [2019-03-28 12:34:32,460 INFO L387 AbstractCegarLoop]: Difference is false 23.82/11.06 [2019-03-28 12:34:32,460 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 23.82/11.06 [2019-03-28 12:34:32,460 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 23.82/11.06 [2019-03-28 12:34:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. 23.82/11.06 [2019-03-28 12:34:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 23.82/11.06 [2019-03-28 12:34:32,482 INFO L394 BasicCegarLoop]: Found error trace 23.82/11.06 [2019-03-28 12:34:32,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 23.82/11.06 [2019-03-28 12:34:32,483 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 23.82/11.06 [2019-03-28 12:34:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash 134090, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:32,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:32,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:32,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:32,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.06 [2019-03-28 12:34:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.06 [2019-03-28 12:34:32,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.82/11.06 [2019-03-28 12:34:32,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 23.82/11.06 [2019-03-28 12:34:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 23.82/11.06 [2019-03-28 12:34:32,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 23.82/11.06 [2019-03-28 12:34:32,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:32,716 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. 23.82/11.06 [2019-03-28 12:34:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.82/11.06 [2019-03-28 12:34:32,899 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. 23.82/11.06 [2019-03-28 12:34:32,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:32,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 23.82/11.06 [2019-03-28 12:34:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.82/11.06 [2019-03-28 12:34:32,915 INFO L225 Difference]: With dead ends: 44 23.82/11.06 [2019-03-28 12:34:32,915 INFO L226 Difference]: Without dead ends: 38 23.82/11.06 [2019-03-28 12:34:32,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 23.82/11.06 [2019-03-28 12:34:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 23.82/11.06 [2019-03-28 12:34:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 23.82/11.06 [2019-03-28 12:34:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 62 transitions. 23.82/11.06 [2019-03-28 12:34:32,961 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 62 transitions. Word has length 3 23.82/11.06 [2019-03-28 12:34:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. 23.82/11.06 [2019-03-28 12:34:32,962 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 62 transitions. 23.82/11.06 [2019-03-28 12:34:32,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 62 transitions. 23.82/11.06 [2019-03-28 12:34:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 23.82/11.06 [2019-03-28 12:34:32,963 INFO L394 BasicCegarLoop]: Found error trace 23.82/11.06 [2019-03-28 12:34:32,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 23.82/11.06 [2019-03-28 12:34:32,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 23.82/11.06 [2019-03-28 12:34:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash 134092, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:32,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:32,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:32,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:32,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.06 [2019-03-28 12:34:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.06 [2019-03-28 12:34:32,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.82/11.06 [2019-03-28 12:34:32,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 23.82/11.06 [2019-03-28 12:34:32,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 23.82/11.06 [2019-03-28 12:34:32,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 23.82/11.06 [2019-03-28 12:34:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:32,997 INFO L87 Difference]: Start difference. First operand 38 states and 62 transitions. Second operand 3 states. 23.82/11.06 [2019-03-28 12:34:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.82/11.06 [2019-03-28 12:34:33,074 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. 23.82/11.06 [2019-03-28 12:34:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 23.82/11.06 [2019-03-28 12:34:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.82/11.06 [2019-03-28 12:34:33,076 INFO L225 Difference]: With dead ends: 44 23.82/11.06 [2019-03-28 12:34:33,076 INFO L226 Difference]: Without dead ends: 38 23.82/11.06 [2019-03-28 12:34:33,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 23.82/11.06 [2019-03-28 12:34:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 23.82/11.06 [2019-03-28 12:34:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 23.82/11.06 [2019-03-28 12:34:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. 23.82/11.06 [2019-03-28 12:34:33,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 3 23.82/11.06 [2019-03-28 12:34:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. 23.82/11.06 [2019-03-28 12:34:33,083 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. 23.82/11.06 [2019-03-28 12:34:33,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. 23.82/11.06 [2019-03-28 12:34:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 23.82/11.06 [2019-03-28 12:34:33,084 INFO L394 BasicCegarLoop]: Found error trace 23.82/11.06 [2019-03-28 12:34:33,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 23.82/11.06 [2019-03-28 12:34:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 134093, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:33,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:33,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.06 [2019-03-28 12:34:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.06 [2019-03-28 12:34:33,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.82/11.06 [2019-03-28 12:34:33,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 23.82/11.06 [2019-03-28 12:34:33,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 23.82/11.06 [2019-03-28 12:34:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 23.82/11.06 [2019-03-28 12:34:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,121 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 3 states. 23.82/11.06 [2019-03-28 12:34:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.82/11.06 [2019-03-28 12:34:33,222 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. 23.82/11.06 [2019-03-28 12:34:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 23.82/11.06 [2019-03-28 12:34:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.82/11.06 [2019-03-28 12:34:33,223 INFO L225 Difference]: With dead ends: 38 23.82/11.06 [2019-03-28 12:34:33,223 INFO L226 Difference]: Without dead ends: 31 23.82/11.06 [2019-03-28 12:34:33,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 23.82/11.06 [2019-03-28 12:34:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 23.82/11.06 [2019-03-28 12:34:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 23.82/11.06 [2019-03-28 12:34:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. 23.82/11.06 [2019-03-28 12:34:33,228 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 3 23.82/11.06 [2019-03-28 12:34:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. 23.82/11.06 [2019-03-28 12:34:33,229 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. 23.82/11.06 [2019-03-28 12:34:33,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. 23.82/11.06 [2019-03-28 12:34:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 23.82/11.06 [2019-03-28 12:34:33,229 INFO L394 BasicCegarLoop]: Found error trace 23.82/11.06 [2019-03-28 12:34:33,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 23.82/11.06 [2019-03-28 12:34:33,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:33,230 INFO L82 PathProgramCache]: Analyzing trace with hash 4155261, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:33,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:33,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:33,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.06 [2019-03-28 12:34:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.06 [2019-03-28 12:34:33,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.82/11.06 [2019-03-28 12:34:33,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 23.82/11.06 [2019-03-28 12:34:33,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 23.82/11.06 [2019-03-28 12:34:33,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 23.82/11.06 [2019-03-28 12:34:33,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,265 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 3 states. 23.82/11.06 [2019-03-28 12:34:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.82/11.06 [2019-03-28 12:34:33,351 INFO L93 Difference]: Finished difference Result 31 states and 49 transitions. 23.82/11.06 [2019-03-28 12:34:33,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 23.82/11.06 [2019-03-28 12:34:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.82/11.06 [2019-03-28 12:34:33,352 INFO L225 Difference]: With dead ends: 31 23.82/11.06 [2019-03-28 12:34:33,352 INFO L226 Difference]: Without dead ends: 24 23.82/11.06 [2019-03-28 12:34:33,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 23.82/11.06 [2019-03-28 12:34:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 23.82/11.06 [2019-03-28 12:34:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 23.82/11.06 [2019-03-28 12:34:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. 23.82/11.06 [2019-03-28 12:34:33,357 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 4 23.82/11.06 [2019-03-28 12:34:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. 23.82/11.06 [2019-03-28 12:34:33,357 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. 23.82/11.06 [2019-03-28 12:34:33,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. 23.82/11.06 [2019-03-28 12:34:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 23.82/11.06 [2019-03-28 12:34:33,358 INFO L394 BasicCegarLoop]: Found error trace 23.82/11.06 [2019-03-28 12:34:33,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 23.82/11.06 [2019-03-28 12:34:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 4155259, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:33,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:33,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.06 [2019-03-28 12:34:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.06 [2019-03-28 12:34:33,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 23.82/11.06 [2019-03-28 12:34:33,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 23.82/11.06 [2019-03-28 12:34:33,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 23.82/11.06 [2019-03-28 12:34:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 23.82/11.06 [2019-03-28 12:34:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,387 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. 23.82/11.06 [2019-03-28 12:34:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 23.82/11.06 [2019-03-28 12:34:33,459 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. 23.82/11.06 [2019-03-28 12:34:33,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 23.82/11.06 [2019-03-28 12:34:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 23.82/11.06 [2019-03-28 12:34:33,461 INFO L225 Difference]: With dead ends: 24 23.82/11.06 [2019-03-28 12:34:33,461 INFO L226 Difference]: Without dead ends: 0 23.82/11.06 [2019-03-28 12:34:33,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 23.82/11.06 [2019-03-28 12:34:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 23.82/11.06 [2019-03-28 12:34:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 23.82/11.06 [2019-03-28 12:34:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 23.82/11.06 [2019-03-28 12:34:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 23.82/11.06 [2019-03-28 12:34:33,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 23.82/11.06 [2019-03-28 12:34:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. 23.82/11.06 [2019-03-28 12:34:33,463 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 23.82/11.06 [2019-03-28 12:34:33,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 23.82/11.06 [2019-03-28 12:34:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 23.82/11.06 [2019-03-28 12:34:33,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 23.82/11.06 [2019-03-28 12:34:33,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 23.82/11.06 [2019-03-28 12:34:33,514 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,516 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 21) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,516 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 10 21) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 21) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,517 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,519 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,519 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 19) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,519 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 23.82/11.06 [2019-03-28 12:34:33,519 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 19) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,520 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 17) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,521 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 23.82/11.06 [2019-03-28 12:34:33,522 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 23.82/11.06 [2019-03-28 12:34:33,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.06 [2019-03-28 12:34:33,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:33 BasicIcfg 23.82/11.06 [2019-03-28 12:34:33,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 23.82/11.06 [2019-03-28 12:34:33,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 23.82/11.06 [2019-03-28 12:34:33,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 23.82/11.06 [2019-03-28 12:34:33,550 INFO L276 PluginConnector]: BuchiAutomizer initialized 23.82/11.06 [2019-03-28 12:34:33,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.82/11.06 [2019-03-28 12:34:33,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:34:31" (1/5) ... 23.82/11.06 [2019-03-28 12:34:33,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173170ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:33, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:33,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.82/11.06 [2019-03-28 12:34:33,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:31" (2/5) ... 23.82/11.06 [2019-03-28 12:34:33,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173170ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:33, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:33,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.82/11.06 [2019-03-28 12:34:33,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:32" (3/5) ... 23.82/11.06 [2019-03-28 12:34:33,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173170ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:33, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:33,553 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.82/11.06 [2019-03-28 12:34:33,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:32" (4/5) ... 23.82/11.06 [2019-03-28 12:34:33,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173170ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:33, skipping insertion in model container 23.82/11.06 [2019-03-28 12:34:33,554 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 23.82/11.06 [2019-03-28 12:34:33,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:33" (5/5) ... 23.82/11.06 [2019-03-28 12:34:33,555 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 23.82/11.06 [2019-03-28 12:34:33,583 INFO L133 ementStrategyFactory]: Using default assertion order modulation 23.82/11.06 [2019-03-28 12:34:33,584 INFO L374 BuchiCegarLoop]: Interprodecural is true 23.82/11.06 [2019-03-28 12:34:33,584 INFO L375 BuchiCegarLoop]: Hoare is true 23.82/11.06 [2019-03-28 12:34:33,584 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 23.82/11.06 [2019-03-28 12:34:33,584 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 23.82/11.06 [2019-03-28 12:34:33,584 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 23.82/11.06 [2019-03-28 12:34:33,584 INFO L379 BuchiCegarLoop]: Difference is false 23.82/11.06 [2019-03-28 12:34:33,584 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 23.82/11.06 [2019-03-28 12:34:33,585 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 23.82/11.06 [2019-03-28 12:34:33,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. 23.82/11.06 [2019-03-28 12:34:33,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 23.82/11.06 [2019-03-28 12:34:33,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.82/11.06 [2019-03-28 12:34:33,596 INFO L119 BuchiIsEmpty]: Starting construction of run 23.82/11.06 [2019-03-28 12:34:33,600 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,600 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,601 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 23.82/11.06 [2019-03-28 12:34:33,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. 23.82/11.06 [2019-03-28 12:34:33,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 23.82/11.06 [2019-03-28 12:34:33,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.82/11.06 [2019-03-28 12:34:33,605 INFO L119 BuchiIsEmpty]: Starting construction of run 23.82/11.06 [2019-03-28 12:34:33,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 23.82/11.06 [2019-03-28 12:34:33,611 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 17#L-1true [169] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 12#L9true [115] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 10#L9-1true [111] L9-1-->L11-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 13#L11-2true 23.82/11.06 [2019-03-28 12:34:33,612 INFO L796 eck$LassoCheckResult]: Loop: 13#L11-2true [91] L11-2-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 40#L11true [105] L11-->L12: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem2_6|) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 21#L12true [124] L12-->L13-3: Formula: (and (= (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1)) |v_#memory_int_6|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 37#L13-3true [128] L13-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 44#L13true [133] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 42#L13-1true [156] L13-1-->L13-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem4_4| |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_4|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 14#L13-4true [118] L13-4-->L20: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_24|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_24|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 15#L20true [225] L20-->L11-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_21)) (= |v_#memory_int_20| (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_21 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1))))) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (select |v_#valid_40| v_ULTIMATE.start_test_fun_~x_ref~0.base_21) 1)) InVars {#valid=|v_#valid_40|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_31|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} OutVars{#valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_31|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_21} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 13#L11-2true 23.82/11.06 [2019-03-28 12:34:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash 4158079, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:33,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:33,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.06 [2019-03-28 12:34:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.06 [2019-03-28 12:34:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash 245443477, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:33,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:33,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.06 [2019-03-28 12:34:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.06 [2019-03-28 12:34:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.06 [2019-03-28 12:34:33,688 INFO L82 PathProgramCache]: Analyzing trace with hash -755154925, now seen corresponding path program 1 times 23.82/11.06 [2019-03-28 12:34:33,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.06 [2019-03-28 12:34:33,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.06 [2019-03-28 12:34:33,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.06 [2019-03-28 12:34:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.06 [2019-03-28 12:34:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.06 [2019-03-28 12:34:34,018 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 23.82/11.06 [2019-03-28 12:34:34,117 INFO L216 LassoAnalysis]: Preferences: 23.82/11.06 [2019-03-28 12:34:34,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 23.82/11.06 [2019-03-28 12:34:34,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 23.82/11.06 [2019-03-28 12:34:34,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 23.82/11.06 [2019-03-28 12:34:34,118 INFO L127 ssoRankerPreferences]: Use exernal solver: false 23.82/11.06 [2019-03-28 12:34:34,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 23.82/11.06 [2019-03-28 12:34:34,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 23.82/11.06 [2019-03-28 12:34:34,119 INFO L130 ssoRankerPreferences]: Path of dumped script: 23.82/11.06 [2019-03-28 12:34:34,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 23.82/11.06 [2019-03-28 12:34:34,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 23.82/11.06 [2019-03-28 12:34:34,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 23.82/11.06 [2019-03-28 12:34:34,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,375 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 23.82/11.06 [2019-03-28 12:34:34,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.06 [2019-03-28 12:34:34,733 INFO L300 LassoAnalysis]: Preprocessing complete. 23.82/11.06 [2019-03-28 12:34:34,738 INFO L497 LassoAnalysis]: Using template 'affine'. 23.82/11.06 [2019-03-28 12:34:34,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.06 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.06 Number of strict supporting invariants: 0 23.82/11.06 Number of non-strict supporting invariants: 1 23.82/11.06 Consider only non-deceasing supporting invariants: true 23.82/11.06 Simplify termination arguments: true 23.82/11.06 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.06 [2019-03-28 12:34:34,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.06 [2019-03-28 12:34:34,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.06 [2019-03-28 12:34:34,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.06 [2019-03-28 12:34:34,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.06 [2019-03-28 12:34:34,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.06 [2019-03-28 12:34:34,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.06 [2019-03-28 12:34:34,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.06 [2019-03-28 12:34:34,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.06 [2019-03-28 12:34:34,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.06 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.06 Number of strict supporting invariants: 0 23.82/11.06 Number of non-strict supporting invariants: 1 23.82/11.06 Consider only non-deceasing supporting invariants: true 23.82/11.06 Simplify termination arguments: true 23.82/11.06 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.06 [2019-03-28 12:34:34,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.06 [2019-03-28 12:34:34,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.06 [2019-03-28 12:34:34,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.06 [2019-03-28 12:34:34,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.06 [2019-03-28 12:34:34,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.06 [2019-03-28 12:34:34,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.06 [2019-03-28 12:34:34,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.06 [2019-03-28 12:34:34,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.06 [2019-03-28 12:34:34,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.06 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.06 Number of strict supporting invariants: 0 23.82/11.06 Number of non-strict supporting invariants: 1 23.82/11.06 Consider only non-deceasing supporting invariants: true 23.82/11.06 Simplify termination arguments: true 23.82/11.06 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.06 [2019-03-28 12:34:34,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.06 [2019-03-28 12:34:34,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.06 [2019-03-28 12:34:34,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.06 [2019-03-28 12:34:34,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.06 [2019-03-28 12:34:34,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.06 [2019-03-28 12:34:34,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.06 [2019-03-28 12:34:34,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.06 [2019-03-28 12:34:34,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:34,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:34,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:34,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:34,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:34,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:34,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:34,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:34,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:34,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:34,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:34,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:34,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:34,830 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 23.82/11.07 [2019-03-28 12:34:34,840 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 23.82/11.07 [2019-03-28 12:34:34,840 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. 23.82/11.07 [2019-03-28 12:34:34,843 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 23.82/11.07 [2019-03-28 12:34:34,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 23.82/11.07 [2019-03-28 12:34:34,844 INFO L518 LassoAnalysis]: Proved termination. 23.82/11.07 [2019-03-28 12:34:34,845 INFO L520 LassoAnalysis]: Termination argument consisting of: 23.82/11.07 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 23.82/11.07 Supporting invariants [] 23.82/11.07 [2019-03-28 12:34:34,882 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed 23.82/11.07 [2019-03-28 12:34:34,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 23.82/11.07 [2019-03-28 12:34:34,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.07 [2019-03-28 12:34:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:34,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:34,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:34,969 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 23.82/11.07 [2019-03-28 12:34:34,969 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:34,974 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:34,974 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:34,975 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 23.82/11.07 [2019-03-28 12:34:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:34,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:34,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:35,034 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 23.82/11.07 [2019-03-28 12:34:35,036 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,045 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:35,046 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,046 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 23.82/11.07 [2019-03-28 12:34:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.07 [2019-03-28 12:34:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:35,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:35,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:35,239 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 23.82/11.07 [2019-03-28 12:34:35,240 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,251 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:35,252 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,253 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 23.82/11.07 [2019-03-28 12:34:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:35,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:35,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:35,393 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 23.82/11.07 [2019-03-28 12:34:35,394 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,403 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:35,404 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,404 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 23.82/11.07 [2019-03-28 12:34:35,441 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 23.82/11.07 [2019-03-28 12:34:35,442 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,453 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:35,455 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,455 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 23.82/11.07 [2019-03-28 12:34:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:35,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:35,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:35,513 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 23.82/11.07 [2019-03-28 12:34:35,515 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,525 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:35,527 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,527 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 23.82/11.07 [2019-03-28 12:34:35,558 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 23.82/11.07 [2019-03-28 12:34:35,559 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,570 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 23.82/11.07 [2019-03-28 12:34:35,572 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 23.82/11.07 [2019-03-28 12:34:35,572 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 23.82/11.07 [2019-03-28 12:34:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:35,588 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 23.82/11.07 [2019-03-28 12:34:35,588 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization 23.82/11.07 [2019-03-28 12:34:35,592 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates 23.82/11.07 [2019-03-28 12:34:35,593 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states. Second operand 7 states. 23.82/11.07 [2019-03-28 12:34:36,325 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states.. Second operand 7 states. Result 151 states and 259 transitions. Complement of second has 20 states. 23.82/11.07 [2019-03-28 12:34:36,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states 23.82/11.07 [2019-03-28 12:34:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 23.82/11.07 [2019-03-28 12:34:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. 23.82/11.07 [2019-03-28 12:34:36,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 4 letters. Loop has 8 letters. 23.82/11.07 [2019-03-28 12:34:36,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.82/11.07 [2019-03-28 12:34:36,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 12 letters. Loop has 8 letters. 23.82/11.07 [2019-03-28 12:34:36,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.82/11.07 [2019-03-28 12:34:36,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 193 transitions. Stem has 4 letters. Loop has 16 letters. 23.82/11.07 [2019-03-28 12:34:36,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.82/11.07 [2019-03-28 12:34:36,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 259 transitions. 23.82/11.07 [2019-03-28 12:34:36,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 23.82/11.07 [2019-03-28 12:34:36,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 47 states and 55 transitions. 23.82/11.07 [2019-03-28 12:34:36,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 23.82/11.07 [2019-03-28 12:34:36,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 23.82/11.07 [2019-03-28 12:34:36,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. 23.82/11.07 [2019-03-28 12:34:36,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 23.82/11.07 [2019-03-28 12:34:36,377 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. 23.82/11.07 [2019-03-28 12:34:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. 23.82/11.07 [2019-03-28 12:34:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. 23.82/11.07 [2019-03-28 12:34:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 23.82/11.07 [2019-03-28 12:34:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. 23.82/11.07 [2019-03-28 12:34:36,380 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. 23.82/11.07 [2019-03-28 12:34:36,381 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. 23.82/11.07 [2019-03-28 12:34:36,381 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 23.82/11.07 [2019-03-28 12:34:36,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. 23.82/11.07 [2019-03-28 12:34:36,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 23.82/11.07 [2019-03-28 12:34:36,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 23.82/11.07 [2019-03-28 12:34:36,382 INFO L119 BuchiIsEmpty]: Starting construction of run 23.82/11.07 [2019-03-28 12:34:36,382 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 23.82/11.07 [2019-03-28 12:34:36,383 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 23.82/11.07 [2019-03-28 12:34:36,384 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY [103] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 426#L-1 [169] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 425#L9 [115] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 418#L9-1 [111] L9-1-->L11-2: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 419#L11-2 [91] L11-2-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 421#L11 [105] L11-->L12: Formula: (<= 0 |v_ULTIMATE.start_test_fun_#t~mem2_6|) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 430#L12 [124] L12-->L13-3: Formula: (and (= (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 1)) |v_#memory_int_6|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 413#L13-3 23.82/11.07 [2019-03-28 12:34:36,385 INFO L796 eck$LassoCheckResult]: Loop: 413#L13-3 [128] L13-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 427#L13 [133] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 432#L13-1 [132] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 433#L14 [98] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 436#L14-1 [159] L14-1-->L18: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem5_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 416#L18 [84] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 412#L18-1 [227] L18-1-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_18) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_25 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_25) v_ULTIMATE.start_test_fun_~y_ref~0.offset_18 (* 2 |v_ULTIMATE.start_test_fun_#t~mem7_6|))) |v_#memory_int_23|) (= 1 (select |v_#valid_43| v_ULTIMATE.start_test_fun_~y_ref~0.base_25)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_18 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_25))) InVars {#valid=|v_#valid_43|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_25, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_43|, #memory_int=|v_#memory_int_23|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_25, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 413#L13-3 23.82/11.07 [2019-03-28 12:34:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.07 [2019-03-28 12:34:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash -680629265, now seen corresponding path program 1 times 23.82/11.07 [2019-03-28 12:34:36,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.07 [2019-03-28 12:34:36,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.07 [2019-03-28 12:34:36,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.07 [2019-03-28 12:34:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash -983145782, now seen corresponding path program 1 times 23.82/11.07 [2019-03-28 12:34:36,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.07 [2019-03-28 12:34:36,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.07 [2019-03-28 12:34:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.07 [2019-03-28 12:34:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 122769180, now seen corresponding path program 1 times 23.82/11.07 [2019-03-28 12:34:36,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 23.82/11.07 [2019-03-28 12:34:36,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 23.82/11.07 [2019-03-28 12:34:36,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 23.82/11.07 [2019-03-28 12:34:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:36,755 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 23.82/11.07 [2019-03-28 12:34:36,853 INFO L216 LassoAnalysis]: Preferences: 23.82/11.07 [2019-03-28 12:34:36,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 23.82/11.07 [2019-03-28 12:34:36,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 23.82/11.07 [2019-03-28 12:34:36,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 23.82/11.07 [2019-03-28 12:34:36,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false 23.82/11.07 [2019-03-28 12:34:36,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 23.82/11.07 [2019-03-28 12:34:36,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 23.82/11.07 [2019-03-28 12:34:36,854 INFO L130 ssoRankerPreferences]: Path of dumped script: 23.82/11.07 [2019-03-28 12:34:36,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 23.82/11.07 [2019-03-28 12:34:36,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 23.82/11.07 [2019-03-28 12:34:36,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 23.82/11.07 [2019-03-28 12:34:36,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:36,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:37,057 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 23.82/11.07 [2019-03-28 12:34:37,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:37,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:37,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 23.82/11.07 [2019-03-28 12:34:37,405 INFO L300 LassoAnalysis]: Preprocessing complete. 23.82/11.07 [2019-03-28 12:34:37,406 INFO L497 LassoAnalysis]: Using template 'affine'. 23.82/11.07 [2019-03-28 12:34:37,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 23.82/11.07 [2019-03-28 12:34:37,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 23.82/11.07 [2019-03-28 12:34:37,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 23.82/11.07 Termination analysis: LINEAR_WITH_GUESSES 23.82/11.07 Number of strict supporting invariants: 0 23.82/11.07 Number of non-strict supporting invariants: 1 23.82/11.07 Consider only non-deceasing supporting invariants: true 23.82/11.07 Simplify termination arguments: true 23.82/11.07 Simplify supporting invariants: trueOverapproximate stem: false 23.82/11.07 [2019-03-28 12:34:37,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. 23.82/11.07 [2019-03-28 12:34:37,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 23.82/11.07 [2019-03-28 12:34:37,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 23.82/11.07 [2019-03-28 12:34:37,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 23.82/11.07 [2019-03-28 12:34:37,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 23.82/11.07 [2019-03-28 12:34:37,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 23.82/11.07 [2019-03-28 12:34:37,476 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 23.82/11.07 [2019-03-28 12:34:37,502 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 23.82/11.07 [2019-03-28 12:34:37,502 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. 23.82/11.07 [2019-03-28 12:34:37,503 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 23.82/11.07 [2019-03-28 12:34:37,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 23.82/11.07 [2019-03-28 12:34:37,504 INFO L518 LassoAnalysis]: Proved termination. 23.82/11.07 [2019-03-28 12:34:37,504 INFO L520 LassoAnalysis]: Termination argument consisting of: 23.82/11.07 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 23.82/11.07 Supporting invariants [] 23.82/11.07 [2019-03-28 12:34:37,534 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 23.82/11.07 [2019-03-28 12:34:37,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 23.82/11.07 [2019-03-28 12:34:37,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 23.82/11.07 [2019-03-28 12:34:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 23.82/11.07 [2019-03-28 12:34:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:37,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:37,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 23.82/11.07 [2019-03-28 12:34:37,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core 23.82/11.07 [2019-03-28 12:34:37,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... 23.82/11.07 [2019-03-28 12:34:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 23.82/11.07 [2019-03-28 12:34:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:37,808 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 23.82/11.07 [2019-03-28 12:34:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:37,815 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 23.82/11.07 [2019-03-28 12:34:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 23.82/11.07 [2019-03-28 12:34:37,823 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 23.82/11.07 [2019-03-28 12:34:37,823 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 23.82/11.07 [2019-03-28 12:34:37,823 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 23.82/11.07 [2019-03-28 12:34:37,824 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 8 states. 23.82/11.07 [2019-03-28 12:34:38,008 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 41 states and 48 transitions. Complement of second has 14 states. 23.82/11.07 [2019-03-28 12:34:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states 23.82/11.07 [2019-03-28 12:34:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 23.82/11.07 [2019-03-28 12:34:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. 23.82/11.07 [2019-03-28 12:34:38,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 7 letters. Loop has 7 letters. 23.82/11.07 [2019-03-28 12:34:38,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.82/11.07 [2019-03-28 12:34:38,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 14 letters. Loop has 7 letters. 23.82/11.07 [2019-03-28 12:34:38,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.82/11.07 [2019-03-28 12:34:38,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 7 letters. Loop has 14 letters. 23.82/11.07 [2019-03-28 12:34:38,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. 23.82/11.07 [2019-03-28 12:34:38,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. 23.82/11.07 [2019-03-28 12:34:38,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 23.82/11.07 [2019-03-28 12:34:38,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 23.82/11.07 [2019-03-28 12:34:38,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 23.82/11.07 [2019-03-28 12:34:38,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 23.82/11.07 [2019-03-28 12:34:38,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 23.82/11.07 [2019-03-28 12:34:38,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 23.82/11.07 [2019-03-28 12:34:38,018 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 23.82/11.07 [2019-03-28 12:34:38,018 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 23.82/11.07 [2019-03-28 12:34:38,018 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 23.82/11.07 [2019-03-28 12:34:38,018 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 23.82/11.07 [2019-03-28 12:34:38,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 23.82/11.07 [2019-03-28 12:34:38,018 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 23.82/11.07 [2019-03-28 12:34:38,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 23.82/11.07 [2019-03-28 12:34:38,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:38 BasicIcfg 23.82/11.07 [2019-03-28 12:34:38,025 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 23.82/11.07 [2019-03-28 12:34:38,025 INFO L168 Benchmark]: Toolchain (without parser) took 6525.55 ms. Allocated memory was 649.6 MB in the beginning and 773.8 MB in the end (delta: 124.3 MB). Free memory was 563.8 MB in the beginning and 408.7 MB in the end (delta: 155.1 MB). Peak memory consumption was 279.4 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,026 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.99 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 563.8 MB in the beginning and 654.6 MB in the end (delta: -90.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 688.4 MB. Free memory was 654.6 MB in the beginning and 651.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,028 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 ms. Allocated memory is still 688.4 MB. Free memory was 651.5 MB in the beginning and 650.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,028 INFO L168 Benchmark]: RCFGBuilder took 358.16 ms. Allocated memory is still 688.4 MB. Free memory was 650.1 MB in the beginning and 623.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,029 INFO L168 Benchmark]: BlockEncodingV2 took 142.18 ms. Allocated memory is still 688.4 MB. Free memory was 623.8 MB in the beginning and 613.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,029 INFO L168 Benchmark]: TraceAbstraction took 1160.67 ms. Allocated memory is still 688.4 MB. Free memory was 613.0 MB in the beginning and 500.2 MB in the end (delta: 112.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,030 INFO L168 Benchmark]: BuchiAutomizer took 4479.20 ms. Allocated memory was 688.4 MB in the beginning and 773.8 MB in the end (delta: 85.5 MB). Free memory was 500.2 MB in the beginning and 408.7 MB in the end (delta: 91.4 MB). Peak memory consumption was 176.9 MB. Max. memory is 50.3 GB. 23.82/11.07 [2019-03-28 12:34:38,034 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 23.82/11.07 --- Results --- 23.82/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 23.82/11.07 - StatisticsResult: Initial Icfg 23.82/11.07 52 locations, 56 edges 23.82/11.07 - StatisticsResult: Encoded RCFG 23.82/11.07 44 locations, 74 edges 23.82/11.07 * Results from de.uni_freiburg.informatik.ultimate.core: 23.82/11.07 - StatisticsResult: Toolchain Benchmarks 23.82/11.07 Benchmark results are: 23.82/11.07 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 23.82/11.07 * CACSL2BoogieTranslator took 313.99 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 563.8 MB in the beginning and 654.6 MB in the end (delta: -90.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 23.82/11.07 * Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 688.4 MB. Free memory was 654.6 MB in the beginning and 651.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 23.82/11.07 * Boogie Preprocessor took 24.75 ms. Allocated memory is still 688.4 MB. Free memory was 651.5 MB in the beginning and 650.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 23.82/11.07 * RCFGBuilder took 358.16 ms. Allocated memory is still 688.4 MB. Free memory was 650.1 MB in the beginning and 623.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 50.3 GB. 23.82/11.07 * BlockEncodingV2 took 142.18 ms. Allocated memory is still 688.4 MB. Free memory was 623.8 MB in the beginning and 613.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 23.82/11.07 * TraceAbstraction took 1160.67 ms. Allocated memory is still 688.4 MB. Free memory was 613.0 MB in the beginning and 500.2 MB in the end (delta: 112.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 50.3 GB. 23.82/11.07 * BuchiAutomizer took 4479.20 ms. Allocated memory was 688.4 MB in the beginning and 773.8 MB in the end (delta: 85.5 MB). Free memory was 500.2 MB in the beginning and 408.7 MB in the end (delta: 91.4 MB). Peak memory consumption was 176.9 MB. Max. memory is 50.3 GB. 23.82/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #length 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #memory_int 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #memory_int 23.82/11.07 - GenericResult: Unfinished Backtranslation 23.82/11.07 unknown boogie variable #memory_int 23.82/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 23.82/11.07 - PositiveResult [Line: 16]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 16]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 18]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 18]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 18]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 18]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 20]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 20]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 9]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 9]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 20]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 20]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 10]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 10]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 22]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 22]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 11]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 11]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 12]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 12]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 13]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 14]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - PositiveResult [Line: 14]: pointer dereference always succeeds 23.82/11.07 For all program executions holds that pointer dereference always succeeds at this location 23.82/11.07 - AllSpecificationsHoldResult: All specifications hold 23.82/11.07 26 specifications checked. All of them hold 23.82/11.07 - InvariantResult [Line: 12]: Loop Invariant 23.82/11.07 [2019-03-28 12:34:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 [2019-03-28 12:34:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 [2019-03-28 12:34:38,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 [2019-03-28 12:34:38,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 23.82/11.07 - InvariantResult [Line: 10]: Loop Invariant 23.82/11.07 [2019-03-28 12:34:38,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 [2019-03-28 12:34:38,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 [2019-03-28 12:34:38,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 [2019-03-28 12:34:38,048 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 23.82/11.07 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 23.82/11.07 - StatisticsResult: Ultimate Automizer benchmark data 23.82/11.07 CFG has 1 procedures, 44 locations, 26 error locations. SAFE Result, 1.0s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 197 SDslu, 3 SDs, 0 SdLazy, 202 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 54 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 23.82/11.07 - StatisticsResult: Constructed decomposition of program 23.82/11.07 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 12 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 23.82/11.07 - StatisticsResult: Timing statistics 23.82/11.07 BüchiAutomizer plugin needed 4.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 514 SDslu, 61 SDs, 0 SdLazy, 580 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax100 hnf100 lsp96 ukn64 mio100 lsp38 div100 bol100 ite100 ukn100 eq166 hnf90 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 23.82/11.07 - TerminationAnalysisResult: Termination proven 23.82/11.07 Buchi Automizer proved that your program is terminating 23.82/11.07 RESULT: Ultimate proved your program to be correct! 23.82/11.07 !SESSION 2019-03-28 12:34:28.185 ----------------------------------------------- 23.82/11.07 eclipse.buildId=unknown 23.82/11.07 java.version=1.8.0_181 23.82/11.07 java.vendor=Oracle Corporation 23.82/11.07 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 23.82/11.07 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 23.82/11.07 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 23.82/11.07 23.82/11.07 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:34:38.274 23.82/11.07 !MESSAGE The workspace will exit with unsaved changes in this session. 23.82/11.07 Received shutdown request... 23.82/11.07 Ultimate: 23.82/11.07 GTK+ Version Check 23.82/11.07 EOF