20.76/10.09 YES 20.76/10.09 20.76/10.09 Ultimate: Cannot open display: 20.76/10.09 This is Ultimate 0.1.24-8dc7c08-m 20.76/10.09 [2019-03-28 12:45:01,386 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.76/10.09 [2019-03-28 12:45:01,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.76/10.09 [2019-03-28 12:45:01,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.76/10.09 [2019-03-28 12:45:01,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.76/10.09 [2019-03-28 12:45:01,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.76/10.09 [2019-03-28 12:45:01,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.76/10.09 [2019-03-28 12:45:01,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.76/10.09 [2019-03-28 12:45:01,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.76/10.09 [2019-03-28 12:45:01,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.76/10.09 [2019-03-28 12:45:01,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.76/10.09 [2019-03-28 12:45:01,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.76/10.09 [2019-03-28 12:45:01,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.76/10.09 [2019-03-28 12:45:01,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.76/10.09 [2019-03-28 12:45:01,411 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.76/10.09 [2019-03-28 12:45:01,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.76/10.09 [2019-03-28 12:45:01,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.76/10.09 [2019-03-28 12:45:01,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.76/10.09 [2019-03-28 12:45:01,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.76/10.09 [2019-03-28 12:45:01,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.76/10.09 [2019-03-28 12:45:01,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.76/10.09 [2019-03-28 12:45:01,422 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.76/10.09 [2019-03-28 12:45:01,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.76/10.09 [2019-03-28 12:45:01,423 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.76/10.09 [2019-03-28 12:45:01,424 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.76/10.09 [2019-03-28 12:45:01,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.76/10.09 [2019-03-28 12:45:01,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.76/10.09 [2019-03-28 12:45:01,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.76/10.09 [2019-03-28 12:45:01,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.76/10.09 [2019-03-28 12:45:01,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.76/10.09 [2019-03-28 12:45:01,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.76/10.09 [2019-03-28 12:45:01,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.76/10.09 [2019-03-28 12:45:01,430 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 20.76/10.09 [2019-03-28 12:45:01,445 INFO L110 SettingsManager]: Loading preferences was successful 20.76/10.09 [2019-03-28 12:45:01,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.76/10.09 [2019-03-28 12:45:01,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.76/10.09 [2019-03-28 12:45:01,446 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.76/10.09 [2019-03-28 12:45:01,446 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.76/10.09 [2019-03-28 12:45:01,446 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.76/10.09 [2019-03-28 12:45:01,447 INFO L133 SettingsManager]: * Use SBE=true 20.76/10.09 [2019-03-28 12:45:01,447 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.76/10.09 [2019-03-28 12:45:01,447 INFO L133 SettingsManager]: * Use old map elimination=false 20.76/10.09 [2019-03-28 12:45:01,447 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.76/10.09 [2019-03-28 12:45:01,447 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.76/10.09 [2019-03-28 12:45:01,448 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.76/10.09 [2019-03-28 12:45:01,448 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.76/10.09 [2019-03-28 12:45:01,448 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.76/10.09 [2019-03-28 12:45:01,448 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.76/10.09 [2019-03-28 12:45:01,448 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.76/10.09 [2019-03-28 12:45:01,448 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.76/10.09 [2019-03-28 12:45:01,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.76/10.09 [2019-03-28 12:45:01,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.76/10.09 [2019-03-28 12:45:01,449 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.76/10.09 [2019-03-28 12:45:01,449 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.76/10.09 [2019-03-28 12:45:01,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.76/10.09 [2019-03-28 12:45:01,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.76/10.09 [2019-03-28 12:45:01,450 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.76/10.09 [2019-03-28 12:45:01,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.76/10.09 [2019-03-28 12:45:01,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.76/10.09 [2019-03-28 12:45:01,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.76/10.09 [2019-03-28 12:45:01,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.76/10.09 [2019-03-28 12:45:01,451 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.76/10.09 [2019-03-28 12:45:01,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.76/10.09 [2019-03-28 12:45:01,490 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.76/10.09 [2019-03-28 12:45:01,493 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.76/10.09 [2019-03-28 12:45:01,495 INFO L271 PluginConnector]: Initializing CDTParser... 20.76/10.09 [2019-03-28 12:45:01,495 INFO L276 PluginConnector]: CDTParser initialized 20.76/10.09 [2019-03-28 12:45:01,496 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 20.76/10.09 [2019-03-28 12:45:01,596 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2340f9432edf4355b82c48e106c7cf73/FLAG50d6c5a23 20.76/10.09 [2019-03-28 12:45:01,943 INFO L307 CDTParser]: Found 1 translation units. 20.76/10.09 [2019-03-28 12:45:01,943 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 20.76/10.09 [2019-03-28 12:45:01,944 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 20.76/10.09 [2019-03-28 12:45:01,950 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2340f9432edf4355b82c48e106c7cf73/FLAG50d6c5a23 20.76/10.09 [2019-03-28 12:45:02,364 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2340f9432edf4355b82c48e106c7cf73 20.76/10.09 [2019-03-28 12:45:02,375 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.76/10.09 [2019-03-28 12:45:02,377 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.76/10.09 [2019-03-28 12:45:02,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.76/10.09 [2019-03-28 12:45:02,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.76/10.09 [2019-03-28 12:45:02,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.76/10.09 [2019-03-28 12:45:02,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ec7d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:02,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.76/10.09 [2019-03-28 12:45:02,412 INFO L176 MainTranslator]: Built tables and reachable declarations 20.76/10.09 [2019-03-28 12:45:02,576 INFO L206 PostProcessor]: Analyzing one entry point: main 20.76/10.09 [2019-03-28 12:45:02,589 INFO L191 MainTranslator]: Completed pre-run 20.76/10.09 [2019-03-28 12:45:02,668 INFO L206 PostProcessor]: Analyzing one entry point: main 20.76/10.09 [2019-03-28 12:45:02,685 INFO L195 MainTranslator]: Completed translation 20.76/10.09 [2019-03-28 12:45:02,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02 WrapperNode 20.76/10.09 [2019-03-28 12:45:02,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.76/10.09 [2019-03-28 12:45:02,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.76/10.09 [2019-03-28 12:45:02,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.76/10.09 [2019-03-28 12:45:02,687 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.76/10.09 [2019-03-28 12:45:02,697 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:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,706 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:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.76/10.09 [2019-03-28 12:45:02,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.76/10.09 [2019-03-28 12:45:02,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.76/10.09 [2019-03-28 12:45:02,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.76/10.09 [2019-03-28 12:45:02,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 [2019-03-28 12:45:02,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.76/10.09 [2019-03-28 12:45:02,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.76/10.09 [2019-03-28 12:45:02,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.76/10.09 [2019-03-28 12:45:02,756 INFO L276 PluginConnector]: RCFGBuilder initialized 20.76/10.09 [2019-03-28 12:45:02,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (1/1) ... 20.76/10.09 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.76/10.09 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.76/10.09 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.76/10.09 [2019-03-28 12:45:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 20.76/10.09 [2019-03-28 12:45:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.76/10.09 [2019-03-28 12:45:02,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.76/10.09 [2019-03-28 12:45:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 20.76/10.09 [2019-03-28 12:45:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 20.76/10.09 [2019-03-28 12:45:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 20.76/10.09 [2019-03-28 12:45:03,068 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.76/10.09 [2019-03-28 12:45:03,069 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 20.76/10.09 [2019-03-28 12:45:03,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:03 BoogieIcfgContainer 20.76/10.09 [2019-03-28 12:45:03,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.76/10.09 [2019-03-28 12:45:03,071 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.76/10.09 [2019-03-28 12:45:03,071 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.76/10.09 [2019-03-28 12:45:03,073 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.76/10.09 [2019-03-28 12:45:03,074 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:03" (1/1) ... 20.76/10.09 [2019-03-28 12:45:03,092 INFO L313 BlockEncoder]: Initial Icfg 23 locations, 27 edges 20.76/10.09 [2019-03-28 12:45:03,094 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.76/10.09 [2019-03-28 12:45:03,095 INFO L263 BlockEncoder]: Using Maximize final states 20.76/10.09 [2019-03-28 12:45:03,096 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.76/10.09 [2019-03-28 12:45:03,096 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.76/10.09 [2019-03-28 12:45:03,098 INFO L296 BlockEncoder]: Using Remove sink states 20.76/10.09 [2019-03-28 12:45:03,099 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.76/10.09 [2019-03-28 12:45:03,099 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.76/10.09 [2019-03-28 12:45:03,124 INFO L185 BlockEncoder]: Using Use SBE 20.76/10.09 [2019-03-28 12:45:03,146 INFO L200 BlockEncoder]: SBE split 7 edges 20.76/10.09 [2019-03-28 12:45:03,151 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 20.76/10.09 [2019-03-28 12:45:03,153 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.76/10.09 [2019-03-28 12:45:03,189 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 20.76/10.09 [2019-03-28 12:45:03,191 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 20.76/10.09 [2019-03-28 12:45:03,193 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.76/10.09 [2019-03-28 12:45:03,193 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.76/10.09 [2019-03-28 12:45:03,193 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.76/10.09 [2019-03-28 12:45:03,194 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.76/10.09 [2019-03-28 12:45:03,194 INFO L313 BlockEncoder]: Encoded RCFG 14 locations, 23 edges 20.76/10.09 [2019-03-28 12:45:03,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:03 BasicIcfg 20.76/10.09 [2019-03-28 12:45:03,195 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.76/10.09 [2019-03-28 12:45:03,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.76/10.09 [2019-03-28 12:45:03,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.76/10.09 [2019-03-28 12:45:03,199 INFO L276 PluginConnector]: TraceAbstraction initialized 20.76/10.09 [2019-03-28 12:45:03,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:02" (1/4) ... 20.76/10.09 [2019-03-28 12:45:03,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3092a3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:03, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:03,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (2/4) ... 20.76/10.09 [2019-03-28 12:45:03,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3092a3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:03, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:03,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:03" (3/4) ... 20.76/10.09 [2019-03-28 12:45:03,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3092a3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:03, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:03,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:03" (4/4) ... 20.76/10.09 [2019-03-28 12:45:03,204 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.76/10.09 [2019-03-28 12:45:03,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.76/10.09 [2019-03-28 12:45:03,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 20.76/10.09 [2019-03-28 12:45:03,242 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 20.76/10.09 [2019-03-28 12:45:03,270 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.76/10.09 [2019-03-28 12:45:03,271 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.76/10.09 [2019-03-28 12:45:03,271 INFO L383 AbstractCegarLoop]: Hoare is true 20.76/10.09 [2019-03-28 12:45:03,272 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.76/10.09 [2019-03-28 12:45:03,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.76/10.09 [2019-03-28 12:45:03,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.76/10.09 [2019-03-28 12:45:03,272 INFO L387 AbstractCegarLoop]: Difference is false 20.76/10.09 [2019-03-28 12:45:03,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.76/10.09 [2019-03-28 12:45:03,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.76/10.09 [2019-03-28 12:45:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. 20.76/10.09 [2019-03-28 12:45:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 20.76/10.09 [2019-03-28 12:45:03,293 INFO L394 BasicCegarLoop]: Found error trace 20.76/10.09 [2019-03-28 12:45:03,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 20.76/10.09 [2019-03-28 12:45:03,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.76/10.09 [2019-03-28 12:45:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash 124970235, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:03,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:03,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:03,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.76/10.09 [2019-03-28 12:45:03,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.76/10.09 [2019-03-28 12:45:03,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.76/10.09 [2019-03-28 12:45:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.76/10.09 [2019-03-28 12:45:03,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.76/10.09 [2019-03-28 12:45:03,495 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. 20.76/10.09 [2019-03-28 12:45:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.76/10.09 [2019-03-28 12:45:03,556 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. 20.76/10.09 [2019-03-28 12:45:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.76/10.09 [2019-03-28 12:45:03,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 20.76/10.09 [2019-03-28 12:45:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.76/10.09 [2019-03-28 12:45:03,570 INFO L225 Difference]: With dead ends: 14 20.76/10.09 [2019-03-28 12:45:03,570 INFO L226 Difference]: Without dead ends: 11 20.76/10.09 [2019-03-28 12:45:03,575 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 20.76/10.09 [2019-03-28 12:45:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 20.76/10.09 [2019-03-28 12:45:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 20.76/10.09 [2019-03-28 12:45:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.76/10.09 [2019-03-28 12:45:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 20.76/10.09 [2019-03-28 12:45:03,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 20.76/10.09 [2019-03-28 12:45:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. 20.76/10.09 [2019-03-28 12:45:03,612 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. 20.76/10.09 [2019-03-28 12:45:03,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.76/10.09 [2019-03-28 12:45:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. 20.76/10.09 [2019-03-28 12:45:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 20.76/10.09 [2019-03-28 12:45:03,613 INFO L394 BasicCegarLoop]: Found error trace 20.76/10.09 [2019-03-28 12:45:03,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 20.76/10.09 [2019-03-28 12:45:03,613 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.76/10.09 [2019-03-28 12:45:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 124970237, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:03,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:03,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:03,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.76/10.09 [2019-03-28 12:45:03,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.76/10.09 [2019-03-28 12:45:03,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.76/10.09 [2019-03-28 12:45:03,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.76/10.09 [2019-03-28 12:45:03,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.76/10.09 [2019-03-28 12:45:03,672 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. 20.76/10.09 [2019-03-28 12:45:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.76/10.09 [2019-03-28 12:45:03,730 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. 20.76/10.09 [2019-03-28 12:45:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.76/10.09 [2019-03-28 12:45:03,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 20.76/10.09 [2019-03-28 12:45:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.76/10.09 [2019-03-28 12:45:03,731 INFO L225 Difference]: With dead ends: 14 20.76/10.09 [2019-03-28 12:45:03,731 INFO L226 Difference]: Without dead ends: 11 20.76/10.09 [2019-03-28 12:45:03,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 20.76/10.09 [2019-03-28 12:45:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 20.76/10.09 [2019-03-28 12:45:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 20.76/10.09 [2019-03-28 12:45:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.76/10.09 [2019-03-28 12:45:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. 20.76/10.09 [2019-03-28 12:45:03,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 5 20.76/10.09 [2019-03-28 12:45:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. 20.76/10.09 [2019-03-28 12:45:03,736 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. 20.76/10.09 [2019-03-28 12:45:03,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.76/10.09 [2019-03-28 12:45:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. 20.76/10.09 [2019-03-28 12:45:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 20.76/10.09 [2019-03-28 12:45:03,737 INFO L394 BasicCegarLoop]: Found error trace 20.76/10.09 [2019-03-28 12:45:03,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 20.76/10.09 [2019-03-28 12:45:03,737 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.76/10.09 [2019-03-28 12:45:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash 124970238, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:03,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.76/10.09 [2019-03-28 12:45:03,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.76/10.09 [2019-03-28 12:45:03,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.76/10.09 [2019-03-28 12:45:03,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.76/10.09 [2019-03-28 12:45:03,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.76/10.09 [2019-03-28 12:45:03,775 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 3 states. 20.76/10.09 [2019-03-28 12:45:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.76/10.09 [2019-03-28 12:45:03,816 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. 20.76/10.09 [2019-03-28 12:45:03,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.76/10.09 [2019-03-28 12:45:03,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 20.76/10.09 [2019-03-28 12:45:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.76/10.09 [2019-03-28 12:45:03,817 INFO L225 Difference]: With dead ends: 19 20.76/10.09 [2019-03-28 12:45:03,817 INFO L226 Difference]: Without dead ends: 16 20.76/10.09 [2019-03-28 12:45:03,818 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 20.76/10.09 [2019-03-28 12:45:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 20.76/10.09 [2019-03-28 12:45:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 20.76/10.09 [2019-03-28 12:45:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 20.76/10.09 [2019-03-28 12:45:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. 20.76/10.09 [2019-03-28 12:45:03,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 5 20.76/10.09 [2019-03-28 12:45:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. 20.76/10.09 [2019-03-28 12:45:03,823 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. 20.76/10.09 [2019-03-28 12:45:03,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.76/10.09 [2019-03-28 12:45:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. 20.76/10.09 [2019-03-28 12:45:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 20.76/10.09 [2019-03-28 12:45:03,824 INFO L394 BasicCegarLoop]: Found error trace 20.76/10.09 [2019-03-28 12:45:03,824 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] 20.76/10.09 [2019-03-28 12:45:03,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 20.76/10.09 [2019-03-28 12:45:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:03,825 INFO L82 PathProgramCache]: Analyzing trace with hash -749255147, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:03,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:03,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:03,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:03,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.76/10.09 [2019-03-28 12:45:03,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.76/10.09 [2019-03-28 12:45:03,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 20.76/10.09 [2019-03-28 12:45:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.76/10.09 [2019-03-28 12:45:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 20.76/10.09 [2019-03-28 12:45:03,865 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 4 states. 20.76/10.09 [2019-03-28 12:45:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.76/10.09 [2019-03-28 12:45:03,902 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. 20.76/10.09 [2019-03-28 12:45:03,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.76/10.09 [2019-03-28 12:45:03,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 20.76/10.09 [2019-03-28 12:45:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.76/10.09 [2019-03-28 12:45:03,903 INFO L225 Difference]: With dead ends: 16 20.76/10.09 [2019-03-28 12:45:03,904 INFO L226 Difference]: Without dead ends: 0 20.76/10.09 [2019-03-28 12:45:03,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 20.76/10.09 [2019-03-28 12:45:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 20.76/10.09 [2019-03-28 12:45:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 20.76/10.09 [2019-03-28 12:45:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 20.76/10.09 [2019-03-28 12:45:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:03,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 20.76/10.09 [2019-03-28 12:45:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. 20.76/10.09 [2019-03-28 12:45:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:03,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 20.76/10.09 [2019-03-28 12:45:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:03,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.76/10.09 [2019-03-28 12:45:03,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:04,084 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,084 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,084 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,084 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,085 INFO L448 ceAbstractionStarter]: For program point L10-1(lines 10 13) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,086 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 20.76/10.09 [2019-03-28 12:45:04,086 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 13) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_test_fun_~a.base)) (.cse1 (* 4 ULTIMATE.start_test_fun_~i~0))) (and (<= (* 4 ULTIMATE.start_test_fun_~N) .cse0) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= (+ .cse1 4) .cse0) (<= 0 (+ .cse1 ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base)))) 20.76/10.09 [2019-03-28 12:45:04,087 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 14) the Hoare annotation is: (and (<= (* 4 ULTIMATE.start_test_fun_~N) (select |#length| ULTIMATE.start_test_fun_~a.base)) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= 0 (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) 20.76/10.09 [2019-03-28 12:45:04,087 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 20.76/10.09 [2019-03-28 12:45:04,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:04,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:04,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:04,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:04,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:04,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:04,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:04 BasicIcfg 20.76/10.09 [2019-03-28 12:45:04,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.76/10.09 [2019-03-28 12:45:04,108 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.76/10.09 [2019-03-28 12:45:04,108 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.76/10.09 [2019-03-28 12:45:04,111 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.76/10.09 [2019-03-28 12:45:04,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.76/10.09 [2019-03-28 12:45:04,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:02" (1/5) ... 20.76/10.09 [2019-03-28 12:45:04,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c45c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:04, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:04,113 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.76/10.09 [2019-03-28 12:45:04,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:02" (2/5) ... 20.76/10.09 [2019-03-28 12:45:04,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c45c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:04, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:04,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.76/10.09 [2019-03-28 12:45:04,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:03" (3/5) ... 20.76/10.09 [2019-03-28 12:45:04,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c45c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:04, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:04,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.76/10.09 [2019-03-28 12:45:04,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:03" (4/5) ... 20.76/10.09 [2019-03-28 12:45:04,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c45c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:04, skipping insertion in model container 20.76/10.09 [2019-03-28 12:45:04,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.76/10.09 [2019-03-28 12:45:04,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:04" (5/5) ... 20.76/10.09 [2019-03-28 12:45:04,116 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.76/10.09 [2019-03-28 12:45:04,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.76/10.09 [2019-03-28 12:45:04,138 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.76/10.09 [2019-03-28 12:45:04,138 INFO L375 BuchiCegarLoop]: Hoare is true 20.76/10.09 [2019-03-28 12:45:04,138 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.76/10.09 [2019-03-28 12:45:04,138 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.76/10.09 [2019-03-28 12:45:04,138 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.76/10.09 [2019-03-28 12:45:04,138 INFO L379 BuchiCegarLoop]: Difference is false 20.76/10.09 [2019-03-28 12:45:04,138 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.76/10.09 [2019-03-28 12:45:04,139 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.76/10.09 [2019-03-28 12:45:04,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. 20.76/10.09 [2019-03-28 12:45:04,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 20.76/10.09 [2019-03-28 12:45:04,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.76/10.09 [2019-03-28 12:45:04,147 INFO L119 BuchiIsEmpty]: Starting construction of run 20.76/10.09 [2019-03-28 12:45:04,151 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.76/10.09 [2019-03-28 12:45:04,151 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.76/10.09 [2019-03-28 12:45:04,152 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.76/10.09 [2019-03-28 12:45:04,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. 20.76/10.09 [2019-03-28 12:45:04,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 20.76/10.09 [2019-03-28 12:45:04,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.76/10.09 [2019-03-28 12:45:04,153 INFO L119 BuchiIsEmpty]: Starting construction of run 20.76/10.09 [2019-03-28 12:45:04,154 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.76/10.09 [2019-03-28 12:45:04,154 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.76/10.09 [2019-03-28 12:45:04,159 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 12#L20true [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 8#L20-2true [89] L20-2-->L9-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 4#L9-3true 20.76/10.09 [2019-03-28 12:45:04,159 INFO L796 eck$LassoCheckResult]: Loop: 4#L9-3true [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 6#L10-3true [57] L10-3-->L10-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 10#L10-1true [105] L10-1-->L9-3: Formula: (and (= v_ULTIMATE.start_test_fun_~i~0_16 (+ v_ULTIMATE.start_test_fun_~i~0_17 1)) (<= |v_ULTIMATE.start_test_fun_#t~mem1_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_17} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 4#L9-3true 20.76/10.09 [2019-03-28 12:45:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash 130320, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:04,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 84518, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:04,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:04,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -412549449, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:04,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:04,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:04,417 INFO L216 LassoAnalysis]: Preferences: 20.76/10.09 [2019-03-28 12:45:04,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.76/10.09 [2019-03-28 12:45:04,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.76/10.09 [2019-03-28 12:45:04,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.76/10.09 [2019-03-28 12:45:04,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.76/10.09 [2019-03-28 12:45:04,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.76/10.09 [2019-03-28 12:45:04,421 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.76/10.09 [2019-03-28 12:45:04,421 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.76/10.09 [2019-03-28 12:45:04,421 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 20.76/10.09 [2019-03-28 12:45:04,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.76/10.09 [2019-03-28 12:45:04,421 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.76/10.09 [2019-03-28 12:45:04,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,587 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 20.76/10.09 [2019-03-28 12:45:04,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:04,931 INFO L300 LassoAnalysis]: Preprocessing complete. 20.76/10.09 [2019-03-28 12:45:04,937 INFO L497 LassoAnalysis]: Using template 'affine'. 20.76/10.09 [2019-03-28 12:45:04,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:04,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:04,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:04,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:04,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:04,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:04,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:04,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:04,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:04,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:04,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:04,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:04,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:04,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:04,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.76/10.09 [2019-03-28 12:45:05,060 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 20.76/10.09 [2019-03-28 12:45:05,060 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. 20.76/10.09 [2019-03-28 12:45:05,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.76/10.09 [2019-03-28 12:45:05,065 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 20.76/10.09 [2019-03-28 12:45:05,065 INFO L518 LassoAnalysis]: Proved termination. 20.76/10.09 [2019-03-28 12:45:05,065 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.76/10.09 Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 20.76/10.09 Supporting invariants [] 20.76/10.09 [2019-03-28 12:45:05,076 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 20.76/10.09 [2019-03-28 12:45:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:05,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:05,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:05,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:05,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:05,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:05,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:05,212 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 20.76/10.09 [2019-03-28 12:45:05,215 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 3 loop predicates 20.76/10.09 [2019-03-28 12:45:05,216 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states. Second operand 3 states. 20.76/10.09 [2019-03-28 12:45:05,298 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states.. Second operand 3 states. Result 37 states and 65 transitions. Complement of second has 4 states. 20.76/10.09 [2019-03-28 12:45:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 20.76/10.09 [2019-03-28 12:45:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 20.76/10.09 [2019-03-28 12:45:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. 20.76/10.09 [2019-03-28 12:45:05,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 3 letters. 20.76/10.09 [2019-03-28 12:45:05,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:05,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 6 letters. Loop has 3 letters. 20.76/10.09 [2019-03-28 12:45:05,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:05,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 3 letters. Loop has 6 letters. 20.76/10.09 [2019-03-28 12:45:05,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:05,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 65 transitions. 20.76/10.09 [2019-03-28 12:45:05,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 20.76/10.09 [2019-03-28 12:45:05,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 25 transitions. 20.76/10.09 [2019-03-28 12:45:05,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 20.76/10.09 [2019-03-28 12:45:05,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 20.76/10.09 [2019-03-28 12:45:05,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. 20.76/10.09 [2019-03-28 12:45:05,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.76/10.09 [2019-03-28 12:45:05,317 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 20.76/10.09 [2019-03-28 12:45:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. 20.76/10.09 [2019-03-28 12:45:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 20.76/10.09 [2019-03-28 12:45:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 20.76/10.09 [2019-03-28 12:45:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. 20.76/10.09 [2019-03-28 12:45:05,321 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. 20.76/10.09 [2019-03-28 12:45:05,321 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. 20.76/10.09 [2019-03-28 12:45:05,321 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.76/10.09 [2019-03-28 12:45:05,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. 20.76/10.09 [2019-03-28 12:45:05,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 20.76/10.09 [2019-03-28 12:45:05,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.76/10.09 [2019-03-28 12:45:05,322 INFO L119 BuchiIsEmpty]: Starting construction of run 20.76/10.09 [2019-03-28 12:45:05,322 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.76/10.09 [2019-03-28 12:45:05,322 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.76/10.09 [2019-03-28 12:45:05,323 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 114#L20 [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 126#L20-2 [88] L20-2-->L9-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 119#L9-3 20.76/10.09 [2019-03-28 12:45:05,323 INFO L796 eck$LassoCheckResult]: Loop: 119#L9-3 [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 120#L10-3 [57] L10-3-->L10-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 124#L10-1 [105] L10-1-->L9-3: Formula: (and (= v_ULTIMATE.start_test_fun_~i~0_16 (+ v_ULTIMATE.start_test_fun_~i~0_17 1)) (<= |v_ULTIMATE.start_test_fun_#t~mem1_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_17} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 119#L9-3 20.76/10.09 [2019-03-28 12:45:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash 130319, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:05,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:05,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:05,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:05,339 INFO L82 PathProgramCache]: Analyzing trace with hash 84518, now seen corresponding path program 2 times 20.76/10.09 [2019-03-28 12:45:05,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:05,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:05,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -412579240, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:05,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:05,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:05,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:05,485 INFO L216 LassoAnalysis]: Preferences: 20.76/10.09 [2019-03-28 12:45:05,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.76/10.09 [2019-03-28 12:45:05,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.76/10.09 [2019-03-28 12:45:05,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.76/10.09 [2019-03-28 12:45:05,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.76/10.09 [2019-03-28 12:45:05,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.76/10.09 [2019-03-28 12:45:05,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.76/10.09 [2019-03-28 12:45:05,486 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.76/10.09 [2019-03-28 12:45:05,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 20.76/10.09 [2019-03-28 12:45:05,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.76/10.09 [2019-03-28 12:45:05,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.76/10.09 [2019-03-28 12:45:05,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:05,814 INFO L300 LassoAnalysis]: Preprocessing complete. 20.76/10.09 [2019-03-28 12:45:05,814 INFO L497 LassoAnalysis]: Using template 'affine'. 20.76/10.09 [2019-03-28 12:45:05,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:05,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:05,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:05,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:05,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:05,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:05,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:05,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:05,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:05,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:05,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:05,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:05,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:05,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:05,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.76/10.09 [2019-03-28 12:45:05,943 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 20.76/10.09 [2019-03-28 12:45:05,943 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. 20.76/10.09 [2019-03-28 12:45:05,943 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.76/10.09 [2019-03-28 12:45:05,945 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 20.76/10.09 [2019-03-28 12:45:05,945 INFO L518 LassoAnalysis]: Proved termination. 20.76/10.09 [2019-03-28 12:45:05,945 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.76/10.09 Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_2, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_2 - 4*ULTIMATE.start_test_fun_~i~0 20.76/10.09 Supporting invariants [] 20.76/10.09 [2019-03-28 12:45:05,954 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 20.76/10.09 [2019-03-28 12:45:05,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:05,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:05,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:05,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:05,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:06,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:06,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:06,083 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 20.76/10.09 [2019-03-28 12:45:06,083 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 3 loop predicates 20.76/10.09 [2019-03-28 12:45:06,083 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. 20.76/10.09 [2019-03-28 12:45:06,129 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 25 states and 33 transitions. Complement of second has 6 states. 20.76/10.09 [2019-03-28 12:45:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 20.76/10.09 [2019-03-28 12:45:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.76/10.09 [2019-03-28 12:45:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. 20.76/10.09 [2019-03-28 12:45:06,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 3 letters. Loop has 3 letters. 20.76/10.09 [2019-03-28 12:45:06,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:06,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 3 letters. 20.76/10.09 [2019-03-28 12:45:06,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:06,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 3 letters. Loop has 6 letters. 20.76/10.09 [2019-03-28 12:45:06,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:06,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. 20.76/10.09 [2019-03-28 12:45:06,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 20.76/10.09 [2019-03-28 12:45:06,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. 20.76/10.09 [2019-03-28 12:45:06,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 20.76/10.09 [2019-03-28 12:45:06,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 20.76/10.09 [2019-03-28 12:45:06,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. 20.76/10.09 [2019-03-28 12:45:06,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.76/10.09 [2019-03-28 12:45:06,138 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. 20.76/10.09 [2019-03-28 12:45:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. 20.76/10.09 [2019-03-28 12:45:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 13. 20.76/10.09 [2019-03-28 12:45:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 20.76/10.09 [2019-03-28 12:45:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 20.76/10.09 [2019-03-28 12:45:06,141 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 20.76/10.09 [2019-03-28 12:45:06,141 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 20.76/10.09 [2019-03-28 12:45:06,141 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.76/10.09 [2019-03-28 12:45:06,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. 20.76/10.09 [2019-03-28 12:45:06,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.76/10.09 [2019-03-28 12:45:06,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.76/10.09 [2019-03-28 12:45:06,142 INFO L119 BuchiIsEmpty]: Starting construction of run 20.76/10.09 [2019-03-28 12:45:06,142 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.76/10.09 [2019-03-28 12:45:06,142 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 20.76/10.09 [2019-03-28 12:45:06,143 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 218#L20 [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 229#L20-2 [89] L20-2-->L9-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 223#L9-3 [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 225#L10-3 20.76/10.09 [2019-03-28 12:45:06,143 INFO L796 eck$LassoCheckResult]: Loop: 225#L10-3 [57] L10-3-->L10-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 227#L10-1 [65] L10-1-->L11: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem1_6|) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 219#L11 [107] L11-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_19))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9))) (and (= |v_ULTIMATE.start_test_fun_#t~mem2_5| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) .cse0)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~a.base_12)) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~post3_5| |v_ULTIMATE.start_test_fun_#t~mem2_5|) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_19} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_5|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~post3] 220#L11-2 [109] L11-2-->L10-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_21))) (let ((.cse1 (+ v_ULTIMATE.start_test_fun_~a.offset_10 .cse0))) (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~a.base_13)) (= v_ULTIMATE.start_test_fun_~res~0_10 (+ v_ULTIMATE.start_test_fun_~res~0_11 1)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_10 .cse0 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~a.base_13)) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_test_fun_~a.base_13 (store (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~a.base_13) .cse1 (+ |v_ULTIMATE.start_test_fun_#t~post3_7| (- 1))))) (<= 0 .cse1)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_10, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_13, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_7|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_21} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_10, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_13, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_6|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_4|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_test_fun_~res~0, #memory_int] 225#L10-3 20.76/10.09 [2019-03-28 12:45:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash 4039975, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:06,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:06,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2687499, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:06,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:06,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:06,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1323064271, now seen corresponding path program 1 times 20.76/10.09 [2019-03-28 12:45:06,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.76/10.09 [2019-03-28 12:45:06,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.76/10.09 [2019-03-28 12:45:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.76/10.09 [2019-03-28 12:45:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,364 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 20.76/10.09 [2019-03-28 12:45:06,418 INFO L216 LassoAnalysis]: Preferences: 20.76/10.09 [2019-03-28 12:45:06,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.76/10.09 [2019-03-28 12:45:06,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.76/10.09 [2019-03-28 12:45:06,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.76/10.09 [2019-03-28 12:45:06,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.76/10.09 [2019-03-28 12:45:06,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.76/10.09 [2019-03-28 12:45:06,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.76/10.09 [2019-03-28 12:45:06,419 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.76/10.09 [2019-03-28 12:45:06,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 20.76/10.09 [2019-03-28 12:45:06,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.76/10.09 [2019-03-28 12:45:06,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.76/10.09 [2019-03-28 12:45:06,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.76/10.09 [2019-03-28 12:45:06,787 INFO L300 LassoAnalysis]: Preprocessing complete. 20.76/10.09 [2019-03-28 12:45:06,787 INFO L497 LassoAnalysis]: Using template 'affine'. 20.76/10.09 [2019-03-28 12:45:06,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:06,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:06,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:06,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:06,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:06,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:06,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:06,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:06,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:06,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:06,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:06,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:06,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:06,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:06,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:06,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:06,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:06,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:06,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:06,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:06,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:06,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:06,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:06,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:06,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:06,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:06,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:06,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:06,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:06,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:06,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:06,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:06,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:06,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.76/10.09 [2019-03-28 12:45:06,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.76/10.09 Termination analysis: LINEAR_WITH_GUESSES 20.76/10.09 Number of strict supporting invariants: 0 20.76/10.09 Number of non-strict supporting invariants: 1 20.76/10.09 Consider only non-deceasing supporting invariants: true 20.76/10.09 Simplify termination arguments: true 20.76/10.09 Simplify supporting invariants: trueOverapproximate stem: false 20.76/10.09 [2019-03-28 12:45:06,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.76/10.09 [2019-03-28 12:45:06,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.76/10.09 [2019-03-28 12:45:06,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.76/10.09 [2019-03-28 12:45:06,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.76/10.09 [2019-03-28 12:45:06,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.76/10.09 [2019-03-28 12:45:06,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.76/10.09 [2019-03-28 12:45:06,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.76/10.09 [2019-03-28 12:45:06,808 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.76/10.09 [2019-03-28 12:45:06,810 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.76/10.09 [2019-03-28 12:45:06,810 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.76/10.09 [2019-03-28 12:45:06,810 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.76/10.09 [2019-03-28 12:45:06,810 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.76/10.09 [2019-03-28 12:45:06,811 INFO L518 LassoAnalysis]: Proved termination. 20.76/10.09 [2019-03-28 12:45:06,811 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.76/10.09 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 20.76/10.09 Supporting invariants [] 20.76/10.09 [2019-03-28 12:45:06,818 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 20.76/10.09 [2019-03-28 12:45:06,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.76/10.09 [2019-03-28 12:45:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.76/10.09 [2019-03-28 12:45:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:06,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:06,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.76/10.09 [2019-03-28 12:45:06,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core 20.76/10.09 [2019-03-28 12:45:06,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.76/10.09 [2019-03-28 12:45:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.76/10.09 [2019-03-28 12:45:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.76/10.09 [2019-03-28 12:45:06,945 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.76/10.09 [2019-03-28 12:45:06,945 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 20.76/10.09 [2019-03-28 12:45:06,945 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 4 loop predicates 20.76/10.09 [2019-03-28 12:45:06,945 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. 20.76/10.09 [2019-03-28 12:45:06,978 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 20 states and 26 transitions. Complement of second has 8 states. 20.76/10.09 [2019-03-28 12:45:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.76/10.09 [2019-03-28 12:45:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.76/10.09 [2019-03-28 12:45:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. 20.76/10.09 [2019-03-28 12:45:06,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. 20.76/10.09 [2019-03-28 12:45:06,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:06,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. 20.76/10.09 [2019-03-28 12:45:06,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:06,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 8 letters. 20.76/10.09 [2019-03-28 12:45:06,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.76/10.09 [2019-03-28 12:45:06,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. 20.76/10.09 [2019-03-28 12:45:06,984 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.76/10.09 [2019-03-28 12:45:06,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:06,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.76/10.09 [2019-03-28 12:45:06,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.76/10.09 [2019-03-28 12:45:06,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:06,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.76/10.09 [2019-03-28 12:45:06,985 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:06,985 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:06,985 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:06,985 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.76/10.09 [2019-03-28 12:45:06,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.76/10.09 [2019-03-28 12:45:06,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.76/10.09 [2019-03-28 12:45:06,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.76/10.09 [2019-03-28 12:45:06,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:06 BasicIcfg 20.76/10.09 [2019-03-28 12:45:06,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.76/10.09 [2019-03-28 12:45:06,992 INFO L168 Benchmark]: Toolchain (without parser) took 4616.19 ms. Allocated memory was 649.6 MB in the beginning and 749.2 MB in the end (delta: 99.6 MB). Free memory was 565.0 MB in the beginning and 358.9 MB in the end (delta: 206.1 MB). Peak memory consumption was 305.7 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,993 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.28 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 565.0 MB in the beginning and 639.6 MB in the end (delta: -74.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 672.1 MB. Free memory was 638.3 MB in the beginning and 635.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,995 INFO L168 Benchmark]: Boogie Preprocessor took 26.22 ms. Allocated memory is still 672.1 MB. Free memory was 635.2 MB in the beginning and 633.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,995 INFO L168 Benchmark]: RCFGBuilder took 314.61 ms. Allocated memory is still 672.1 MB. Free memory was 633.8 MB in the beginning and 614.4 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,996 INFO L168 Benchmark]: BlockEncodingV2 took 123.94 ms. Allocated memory is still 672.1 MB. Free memory was 614.4 MB in the beginning and 606.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,997 INFO L168 Benchmark]: TraceAbstraction took 911.25 ms. Allocated memory is still 672.1 MB. Free memory was 605.0 MB in the beginning and 523.9 MB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:06,997 INFO L168 Benchmark]: BuchiAutomizer took 2883.85 ms. Allocated memory was 672.1 MB in the beginning and 749.2 MB in the end (delta: 77.1 MB). Free memory was 522.6 MB in the beginning and 358.9 MB in the end (delta: 163.7 MB). Peak memory consumption was 240.8 MB. Max. memory is 50.3 GB. 20.76/10.09 [2019-03-28 12:45:07,001 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.76/10.09 --- Results --- 20.76/10.09 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.76/10.09 - StatisticsResult: Initial Icfg 20.76/10.09 23 locations, 27 edges 20.76/10.09 - StatisticsResult: Encoded RCFG 20.76/10.09 14 locations, 23 edges 20.76/10.09 * Results from de.uni_freiburg.informatik.ultimate.core: 20.76/10.09 - StatisticsResult: Toolchain Benchmarks 20.76/10.09 Benchmark results are: 20.76/10.09 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.76/10.09 * CACSL2BoogieTranslator took 308.28 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 565.0 MB in the beginning and 639.6 MB in the end (delta: -74.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 20.76/10.09 * Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 672.1 MB. Free memory was 638.3 MB in the beginning and 635.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.76/10.09 * Boogie Preprocessor took 26.22 ms. Allocated memory is still 672.1 MB. Free memory was 635.2 MB in the beginning and 633.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.76/10.09 * RCFGBuilder took 314.61 ms. Allocated memory is still 672.1 MB. Free memory was 633.8 MB in the beginning and 614.4 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 50.3 GB. 20.76/10.09 * BlockEncodingV2 took 123.94 ms. Allocated memory is still 672.1 MB. Free memory was 614.4 MB in the beginning and 606.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 20.76/10.09 * TraceAbstraction took 911.25 ms. Allocated memory is still 672.1 MB. Free memory was 605.0 MB in the beginning and 523.9 MB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 50.3 GB. 20.76/10.09 * BuchiAutomizer took 2883.85 ms. Allocated memory was 672.1 MB in the beginning and 749.2 MB in the end (delta: 77.1 MB). Free memory was 522.6 MB in the beginning and 358.9 MB in the end (delta: 163.7 MB). Peak memory consumption was 240.8 MB. Max. memory is 50.3 GB. 20.76/10.09 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #length 20.76/10.09 - GenericResult: Unfinished Backtranslation 20.76/10.09 unknown boogie variable #memory_int 20.76/10.09 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.76/10.09 - PositiveResult [Line: 11]: pointer dereference always succeeds 20.76/10.09 For all program executions holds that pointer dereference always succeeds at this location 20.76/10.09 - PositiveResult [Line: 11]: pointer dereference always succeeds 20.76/10.09 For all program executions holds that pointer dereference always succeeds at this location 20.76/10.09 - PositiveResult [Line: 11]: pointer dereference always succeeds 20.76/10.09 For all program executions holds that pointer dereference always succeeds at this location 20.76/10.09 - PositiveResult [Line: 11]: pointer dereference always succeeds 20.76/10.09 For all program executions holds that pointer dereference always succeeds at this location 20.76/10.09 - PositiveResult [Line: 10]: pointer dereference always succeeds 20.76/10.09 For all program executions holds that pointer dereference always succeeds at this location 20.76/10.09 - PositiveResult [Line: 10]: pointer dereference always succeeds 20.76/10.09 For all program executions holds that pointer dereference always succeeds at this location 20.76/10.09 - AllSpecificationsHoldResult: All specifications hold 20.76/10.09 6 specifications checked. All of them hold 20.76/10.09 - InvariantResult [Line: 9]: Loop Invariant 20.76/10.09 [2019-03-28 12:45:07,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 Derived loop invariant: ((4 * N <= unknown-#length-unknown[a] && 0 == a) && 0 <= 4 * i + a) && 1 == \valid[a] 20.76/10.09 - InvariantResult [Line: 10]: Loop Invariant 20.76/10.09 [2019-03-28 12:45:07,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 [2019-03-28 12:45:07,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.76/10.09 Derived loop invariant: (((4 * N <= unknown-#length-unknown[a] && 0 == a) && 4 * i + 4 <= unknown-#length-unknown[a]) && 0 <= 4 * i + a) && 1 == \valid[a] 20.76/10.09 - StatisticsResult: Ultimate Automizer benchmark data 20.76/10.09 CFG has 1 procedures, 14 locations, 6 error locations. SAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 38 SDslu, 16 SDs, 0 SdLazy, 70 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 55 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 20.76/10.09 - StatisticsResult: Constructed decomposition of program 20.76/10.09 Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function N + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 5 locations. 20.76/10.09 - StatisticsResult: Timing statistics 20.76/10.09 BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 89 SDslu, 16 SDs, 0 SdLazy, 115 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp91 ukn84 mio100 lsp60 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 20.76/10.09 - TerminationAnalysisResult: Termination proven 20.76/10.09 Buchi Automizer proved that your program is terminating 20.76/10.09 RESULT: Ultimate proved your program to be correct! 20.76/10.09 !SESSION 2019-03-28 12:44:59.029 ----------------------------------------------- 20.76/10.09 eclipse.buildId=unknown 20.76/10.09 java.version=1.8.0_181 20.76/10.09 java.vendor=Oracle Corporation 20.76/10.09 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.76/10.09 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.76/10.09 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 20.76/10.09 20.76/10.09 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:45:07.262 20.76/10.09 !MESSAGE The workspace will exit with unsaved changes in this session. 20.76/10.09 Received shutdown request... 20.76/10.09 Ultimate: 20.76/10.09 GTK+ Version Check 20.76/10.09 EOF