21.89/10.29 NO 21.89/10.29 21.89/10.30 Ultimate: Cannot open display: 21.89/10.30 This is Ultimate 0.1.24-8dc7c08-m 21.89/10.30 [2019-03-29 02:10:59,536 INFO L170 SettingsManager]: Resetting all preferences to default values... 21.89/10.30 [2019-03-29 02:10:59,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 21.89/10.30 [2019-03-29 02:10:59,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 21.89/10.30 [2019-03-29 02:10:59,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 21.89/10.30 [2019-03-29 02:10:59,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 21.89/10.30 [2019-03-29 02:10:59,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 21.89/10.30 [2019-03-29 02:10:59,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 21.89/10.30 [2019-03-29 02:10:59,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 21.89/10.30 [2019-03-29 02:10:59,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 21.89/10.30 [2019-03-29 02:10:59,558 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 21.89/10.30 [2019-03-29 02:10:59,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 21.89/10.30 [2019-03-29 02:10:59,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 21.89/10.30 [2019-03-29 02:10:59,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 21.89/10.30 [2019-03-29 02:10:59,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 21.89/10.30 [2019-03-29 02:10:59,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 21.89/10.30 [2019-03-29 02:10:59,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 21.89/10.30 [2019-03-29 02:10:59,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 21.89/10.30 [2019-03-29 02:10:59,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 21.89/10.30 [2019-03-29 02:10:59,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 21.89/10.30 [2019-03-29 02:10:59,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 21.89/10.30 [2019-03-29 02:10:59,572 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 21.89/10.30 [2019-03-29 02:10:59,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 21.89/10.30 [2019-03-29 02:10:59,574 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 21.89/10.30 [2019-03-29 02:10:59,575 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 21.89/10.30 [2019-03-29 02:10:59,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 21.89/10.30 [2019-03-29 02:10:59,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 21.89/10.30 [2019-03-29 02:10:59,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 21.89/10.30 [2019-03-29 02:10:59,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,578 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 21.89/10.30 [2019-03-29 02:10:59,578 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 21.89/10.30 [2019-03-29 02:10:59,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 21.89/10.30 [2019-03-29 02:10:59,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 21.89/10.30 [2019-03-29 02:10:59,580 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 21.89/10.30 [2019-03-29 02:10:59,594 INFO L110 SettingsManager]: Loading preferences was successful 21.89/10.30 [2019-03-29 02:10:59,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 21.89/10.30 [2019-03-29 02:10:59,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 21.89/10.30 [2019-03-29 02:10:59,596 INFO L133 SettingsManager]: * Rewrite not-equals=true 21.89/10.30 [2019-03-29 02:10:59,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 21.89/10.30 [2019-03-29 02:10:59,596 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 21.89/10.30 [2019-03-29 02:10:59,597 INFO L133 SettingsManager]: * Use SBE=true 21.89/10.30 [2019-03-29 02:10:59,597 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 21.89/10.30 [2019-03-29 02:10:59,597 INFO L133 SettingsManager]: * Use old map elimination=false 21.89/10.30 [2019-03-29 02:10:59,597 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 21.89/10.30 [2019-03-29 02:10:59,597 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 21.89/10.30 [2019-03-29 02:10:59,598 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 21.89/10.30 [2019-03-29 02:10:59,598 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 21.89/10.30 [2019-03-29 02:10:59,598 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 21.89/10.30 [2019-03-29 02:10:59,598 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.89/10.30 [2019-03-29 02:10:59,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 21.89/10.30 [2019-03-29 02:10:59,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 21.89/10.30 [2019-03-29 02:10:59,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE 21.89/10.30 [2019-03-29 02:10:59,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 21.89/10.30 [2019-03-29 02:10:59,599 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 21.89/10.30 [2019-03-29 02:10:59,599 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 21.89/10.30 [2019-03-29 02:10:59,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 21.89/10.30 [2019-03-29 02:10:59,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 21.89/10.30 [2019-03-29 02:10:59,600 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 21.89/10.30 [2019-03-29 02:10:59,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.89/10.30 [2019-03-29 02:10:59,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 21.89/10.30 [2019-03-29 02:10:59,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 21.89/10.30 [2019-03-29 02:10:59,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 21.89/10.30 [2019-03-29 02:10:59,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 21.89/10.30 [2019-03-29 02:10:59,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 21.89/10.30 [2019-03-29 02:10:59,642 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 21.89/10.30 [2019-03-29 02:10:59,646 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 21.89/10.30 [2019-03-29 02:10:59,647 INFO L271 PluginConnector]: Initializing CDTParser... 21.89/10.30 [2019-03-29 02:10:59,648 INFO L276 PluginConnector]: CDTParser initialized 21.89/10.30 [2019-03-29 02:10:59,648 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 21.89/10.30 [2019-03-29 02:10:59,706 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/3c248d6f5cc44df6aa9c828357c9cfba/FLAGaaedd1751 21.89/10.30 [2019-03-29 02:11:00,045 INFO L307 CDTParser]: Found 1 translation units. 21.89/10.30 [2019-03-29 02:11:00,046 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 21.89/10.30 [2019-03-29 02:11:00,052 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/3c248d6f5cc44df6aa9c828357c9cfba/FLAGaaedd1751 21.89/10.30 [2019-03-29 02:11:00,454 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/3c248d6f5cc44df6aa9c828357c9cfba 21.97/10.30 [2019-03-29 02:11:00,465 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 21.97/10.30 [2019-03-29 02:11:00,467 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 21.97/10.30 [2019-03-29 02:11:00,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 21.97/10.30 [2019-03-29 02:11:00,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 21.97/10.30 [2019-03-29 02:11:00,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 21.97/10.30 [2019-03-29 02:11:00,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6039cbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:00,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 21.97/10.30 [2019-03-29 02:11:00,501 INFO L176 MainTranslator]: Built tables and reachable declarations 21.97/10.30 [2019-03-29 02:11:00,659 INFO L206 PostProcessor]: Analyzing one entry point: main 21.97/10.30 [2019-03-29 02:11:00,663 INFO L191 MainTranslator]: Completed pre-run 21.97/10.30 [2019-03-29 02:11:00,680 INFO L206 PostProcessor]: Analyzing one entry point: main 21.97/10.30 [2019-03-29 02:11:00,695 INFO L195 MainTranslator]: Completed translation 21.97/10.30 [2019-03-29 02:11:00,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00 WrapperNode 21.97/10.30 [2019-03-29 02:11:00,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 21.97/10.30 [2019-03-29 02:11:00,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 21.97/10.30 [2019-03-29 02:11:00,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 21.97/10.30 [2019-03-29 02:11:00,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 21.97/10.30 [2019-03-29 02:11:00,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 21.97/10.30 [2019-03-29 02:11:00,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 21.97/10.30 [2019-03-29 02:11:00,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 21.97/10.30 [2019-03-29 02:11:00,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized 21.97/10.30 [2019-03-29 02:11:00,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 [2019-03-29 02:11:00,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 21.97/10.30 [2019-03-29 02:11:00,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 21.97/10.30 [2019-03-29 02:11:00,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... 21.97/10.30 [2019-03-29 02:11:00,822 INFO L276 PluginConnector]: RCFGBuilder initialized 21.97/10.30 [2019-03-29 02:11:00,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (1/1) ... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.97/10.30 [2019-03-29 02:11:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 21.97/10.30 [2019-03-29 02:11:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 21.97/10.30 [2019-03-29 02:11:01,030 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 21.97/10.30 [2019-03-29 02:11:01,030 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 21.97/10.30 [2019-03-29 02:11:01,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:11:01 BoogieIcfgContainer 21.97/10.30 [2019-03-29 02:11:01,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 21.97/10.30 [2019-03-29 02:11:01,032 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 21.97/10.30 [2019-03-29 02:11:01,032 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 21.97/10.30 [2019-03-29 02:11:01,035 INFO L276 PluginConnector]: BlockEncodingV2 initialized 21.97/10.30 [2019-03-29 02:11:01,036 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:11:01" (1/1) ... 21.97/10.30 [2019-03-29 02:11:01,052 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 21.97/10.30 [2019-03-29 02:11:01,054 INFO L258 BlockEncoder]: Using Remove infeasible edges 21.97/10.30 [2019-03-29 02:11:01,054 INFO L263 BlockEncoder]: Using Maximize final states 21.97/10.30 [2019-03-29 02:11:01,055 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 21.97/10.30 [2019-03-29 02:11:01,055 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 21.97/10.30 [2019-03-29 02:11:01,057 INFO L296 BlockEncoder]: Using Remove sink states 21.97/10.30 [2019-03-29 02:11:01,059 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 21.97/10.30 [2019-03-29 02:11:01,059 INFO L179 BlockEncoder]: Using Rewrite not-equals 21.97/10.30 [2019-03-29 02:11:01,075 INFO L185 BlockEncoder]: Using Use SBE 21.97/10.30 [2019-03-29 02:11:01,090 INFO L200 BlockEncoder]: SBE split 1 edges 21.97/10.30 [2019-03-29 02:11:01,095 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 21.97/10.30 [2019-03-29 02:11:01,097 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.97/10.30 [2019-03-29 02:11:01,111 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 21.97/10.30 [2019-03-29 02:11:01,113 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 21.97/10.30 [2019-03-29 02:11:01,115 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.97/10.30 [2019-03-29 02:11:01,115 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.97/10.30 [2019-03-29 02:11:01,115 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 21.97/10.30 [2019-03-29 02:11:01,115 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.97/10.30 [2019-03-29 02:11:01,116 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges 21.97/10.30 [2019-03-29 02:11:01,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:11:01 BasicIcfg 21.97/10.30 [2019-03-29 02:11:01,116 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 21.97/10.30 [2019-03-29 02:11:01,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 21.97/10.30 [2019-03-29 02:11:01,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... 21.97/10.30 [2019-03-29 02:11:01,121 INFO L276 PluginConnector]: TraceAbstraction initialized 21.97/10.30 [2019-03-29 02:11:01,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 02:11:00" (1/4) ... 21.97/10.30 [2019-03-29 02:11:01,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e6bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (2/4) ... 21.97/10.30 [2019-03-29 02:11:01,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e6bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:11:01" (3/4) ... 21.97/10.30 [2019-03-29 02:11:01,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e6bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:11:01" (4/4) ... 21.97/10.30 [2019-03-29 02:11:01,125 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.97/10.30 [2019-03-29 02:11:01,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 21.97/10.30 [2019-03-29 02:11:01,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 21.97/10.30 [2019-03-29 02:11:01,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 21.97/10.30 [2019-03-29 02:11:01,190 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.97/10.30 [2019-03-29 02:11:01,191 INFO L382 AbstractCegarLoop]: Interprodecural is true 21.97/10.30 [2019-03-29 02:11:01,191 INFO L383 AbstractCegarLoop]: Hoare is true 21.97/10.30 [2019-03-29 02:11:01,191 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 21.97/10.30 [2019-03-29 02:11:01,191 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 21.97/10.30 [2019-03-29 02:11:01,191 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.97/10.30 [2019-03-29 02:11:01,191 INFO L387 AbstractCegarLoop]: Difference is false 21.97/10.30 [2019-03-29 02:11:01,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 21.97/10.30 [2019-03-29 02:11:01,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 21.97/10.30 [2019-03-29 02:11:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 21.97/10.30 [2019-03-29 02:11:01,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 21.97/10.30 [2019-03-29 02:11:01,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 21.97/10.30 [2019-03-29 02:11:01,264 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 21.97/10.30 [2019-03-29 02:11:01,265 INFO L451 ceAbstractionStarter]: At program point L13-1(lines 9 18) the Hoare annotation is: true 21.97/10.30 [2019-03-29 02:11:01,265 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 12) no Hoare annotation was computed. 21.97/10.30 [2019-03-29 02:11:01,265 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 9 18) no Hoare annotation was computed. 21.97/10.30 [2019-03-29 02:11:01,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:11:01 BasicIcfg 21.97/10.30 [2019-03-29 02:11:01,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 21.97/10.30 [2019-03-29 02:11:01,274 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 21.97/10.30 [2019-03-29 02:11:01,274 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 21.97/10.30 [2019-03-29 02:11:01,277 INFO L276 PluginConnector]: BuchiAutomizer initialized 21.97/10.30 [2019-03-29 02:11:01,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.97/10.30 [2019-03-29 02:11:01,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 02:11:00" (1/5) ... 21.97/10.30 [2019-03-29 02:11:01,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ef8f790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,279 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.97/10.30 [2019-03-29 02:11:01,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:11:00" (2/5) ... 21.97/10.30 [2019-03-29 02:11:01,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ef8f790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.97/10.30 [2019-03-29 02:11:01,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:11:01" (3/5) ... 21.97/10.30 [2019-03-29 02:11:01,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ef8f790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.97/10.30 [2019-03-29 02:11:01,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:11:01" (4/5) ... 21.97/10.30 [2019-03-29 02:11:01,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ef8f790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:11:01, skipping insertion in model container 21.97/10.30 [2019-03-29 02:11:01,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.97/10.30 [2019-03-29 02:11:01,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:11:01" (5/5) ... 21.97/10.30 [2019-03-29 02:11:01,283 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.97/10.30 [2019-03-29 02:11:01,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.97/10.30 [2019-03-29 02:11:01,311 INFO L374 BuchiCegarLoop]: Interprodecural is true 21.97/10.30 [2019-03-29 02:11:01,312 INFO L375 BuchiCegarLoop]: Hoare is true 21.97/10.30 [2019-03-29 02:11:01,312 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 21.97/10.30 [2019-03-29 02:11:01,312 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 21.97/10.30 [2019-03-29 02:11:01,312 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.97/10.30 [2019-03-29 02:11:01,312 INFO L379 BuchiCegarLoop]: Difference is false 21.97/10.30 [2019-03-29 02:11:01,312 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 21.97/10.30 [2019-03-29 02:11:01,312 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 21.97/10.30 [2019-03-29 02:11:01,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 21.97/10.30 [2019-03-29 02:11:01,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.97/10.30 [2019-03-29 02:11:01,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:01,335 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:01,341 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.97/10.30 [2019-03-29 02:11:01,341 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.97/10.30 [2019-03-29 02:11:01,341 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 21.97/10.30 [2019-03-29 02:11:01,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 21.97/10.30 [2019-03-29 02:11:01,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.97/10.30 [2019-03-29 02:11:01,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:01,342 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:01,342 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.97/10.30 [2019-03-29 02:11:01,342 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.97/10.30 [2019-03-29 02:11:01,348 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5#L13-1true 21.97/10.30 [2019-03-29 02:11:01,348 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3#L10true [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 6#L10-2true [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L13-1true 21.97/10.30 [2019-03-29 02:11:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:01,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:01,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:01,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash 64827, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:01,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:01,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1911869, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:01,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:01,513 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:01,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:01,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:01,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:01,515 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.97/10.30 [2019-03-29 02:11:01,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:01,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:01,515 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:01,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 21.97/10.30 [2019-03-29 02:11:01,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:01,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:01,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:01,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:01,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:01,630 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:01,631 INFO L412 LassoAnalysis]: Checking for nontermination... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:01,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:01,639 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:01,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:01,674 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:01,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:01,682 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:01,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:01,710 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:01,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:01,717 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:01,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:01,750 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:01,756 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.97/10.30 [2019-03-29 02:11:01,780 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:01,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:01,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:01,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:01,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.97/10.30 [2019-03-29 02:11:01,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:01,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:01,782 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:01,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 21.97/10.30 [2019-03-29 02:11:01,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:01,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:01,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:01,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:01,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:01,867 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:01,873 INFO L497 LassoAnalysis]: Using template 'affine'. 21.97/10.30 [2019-03-29 02:11:01,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:01,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:01,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:01,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:01,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:01,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:01,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:01,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.97/10.30 [2019-03-29 02:11:01,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:01,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:01,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:01,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:01,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:01,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:01,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:01,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.97/10.30 [2019-03-29 02:11:01,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:01,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:01,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.97/10.30 [2019-03-29 02:11:01,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:01,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:01,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:01,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:01,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:01,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.97/10.30 [2019-03-29 02:11:01,923 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.97/10.30 [2019-03-29 02:11:01,923 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 21.97/10.30 [2019-03-29 02:11:01,925 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.97/10.30 [2019-03-29 02:11:01,926 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.97/10.30 [2019-03-29 02:11:01,926 INFO L518 LassoAnalysis]: Proved termination. 21.97/10.30 [2019-03-29 02:11:01,926 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.97/10.30 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 21.97/10.30 Supporting invariants [] 21.97/10.30 [2019-03-29 02:11:01,928 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.97/10.30 [2019-03-29 02:11:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:01,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:01,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:01,982 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:01,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:02,035 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:02,068 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 21.97/10.30 [2019-03-29 02:11:02,074 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 21.97/10.30 [2019-03-29 02:11:02,076 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 21.97/10.30 [2019-03-29 02:11:02,149 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 17 states and 32 transitions. Complement of second has 7 states. 21.97/10.30 [2019-03-29 02:11:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 21.97/10.30 [2019-03-29 02:11:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 21.97/10.30 [2019-03-29 02:11:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. 21.97/10.30 [2019-03-29 02:11:02,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. 21.97/10.30 [2019-03-29 02:11:02,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:02,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 21.97/10.30 [2019-03-29 02:11:02,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:02,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. 21.97/10.30 [2019-03-29 02:11:02,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:02,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 32 transitions. 21.97/10.30 [2019-03-29 02:11:02,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 21.97/10.30 [2019-03-29 02:11:02,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 24 transitions. 21.97/10.30 [2019-03-29 02:11:02,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 21.97/10.30 [2019-03-29 02:11:02,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 21.97/10.30 [2019-03-29 02:11:02,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 24 transitions. 21.97/10.30 [2019-03-29 02:11:02,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:02,172 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 21.97/10.30 [2019-03-29 02:11:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 24 transitions. 21.97/10.30 [2019-03-29 02:11:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. 21.97/10.30 [2019-03-29 02:11:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 21.97/10.30 [2019-03-29 02:11:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:02,203 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:02,203 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:02,203 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 21.97/10.30 [2019-03-29 02:11:02,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:02,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 21.97/10.30 [2019-03-29 02:11:02,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:02,204 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:02,205 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.97/10.30 [2019-03-29 02:11:02,205 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.97/10.30 [2019-03-29 02:11:02,205 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 77#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 72#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 73#L10-2 21.97/10.30 [2019-03-29 02:11:02,206 INFO L796 eck$LassoCheckResult]: Loop: 73#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 78#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 79#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 73#L10-2 21.97/10.30 [2019-03-29 02:11:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 61658, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:02,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash 66477, now seen corresponding path program 2 times 21.97/10.30 [2019-03-29 02:11:02,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:02,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1836890164, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:02,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:02,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,252 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:02,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:02,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:02,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:02,253 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.97/10.30 [2019-03-29 02:11:02,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:02,253 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:02,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 21.97/10.30 [2019-03-29 02:11:02,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:02,253 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:02,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,317 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:02,317 INFO L412 LassoAnalysis]: Checking for nontermination... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:02,324 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:02,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:02,354 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:02,369 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:02,398 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:02,398 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:02,409 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:02,442 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:02,499 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.97/10.30 [2019-03-29 02:11:02,502 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:02,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:02,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:02,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:02,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.97/10.30 [2019-03-29 02:11:02,502 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:02,503 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:02,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 21.97/10.30 [2019-03-29 02:11:02,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:02,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:02,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,565 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:02,565 INFO L497 LassoAnalysis]: Using template 'affine'. 21.97/10.30 [2019-03-29 02:11:02,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:02,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:02,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:02,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:02,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:02,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:02,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:02,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.97/10.30 [2019-03-29 02:11:02,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:02,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:02,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:02,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:02,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:02,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:02,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:02,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.97/10.30 [2019-03-29 02:11:02,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:02,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:02,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.97/10.30 [2019-03-29 02:11:02,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:02,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:02,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:02,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:02,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:02,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.97/10.30 [2019-03-29 02:11:02,597 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.97/10.30 [2019-03-29 02:11:02,597 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 21.97/10.30 [2019-03-29 02:11:02,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.97/10.30 [2019-03-29 02:11:02,598 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.97/10.30 [2019-03-29 02:11:02,598 INFO L518 LassoAnalysis]: Proved termination. 21.97/10.30 [2019-03-29 02:11:02,598 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.97/10.30 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 21.97/10.30 Supporting invariants [] 21.97/10.30 [2019-03-29 02:11:02,598 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.97/10.30 [2019-03-29 02:11:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:02,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:02,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:02,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:02,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:02,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:02,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:02,716 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 21.97/10.30 [2019-03-29 02:11:02,716 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 5 loop predicates 21.97/10.30 [2019-03-29 02:11:02,717 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 16 transitions. cyclomatic complexity: 9 Second operand 4 states. 21.97/10.30 [2019-03-29 02:11:02,894 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 16 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 20 states. 21.97/10.30 [2019-03-29 02:11:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 3 accepting loop states 21.97/10.30 [2019-03-29 02:11:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.97/10.30 [2019-03-29 02:11:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. 21.97/10.30 [2019-03-29 02:11:02,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. 21.97/10.30 [2019-03-29 02:11:02,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:02,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. 21.97/10.30 [2019-03-29 02:11:02,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:02,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. 21.97/10.30 [2019-03-29 02:11:02,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:02,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. 21.97/10.30 [2019-03-29 02:11:02,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 21.97/10.30 [2019-03-29 02:11:02,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 34 transitions. 21.97/10.30 [2019-03-29 02:11:02,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 21.97/10.30 [2019-03-29 02:11:02,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 21.97/10.30 [2019-03-29 02:11:02,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 34 transitions. 21.97/10.30 [2019-03-29 02:11:02,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:02,905 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 34 transitions. 21.97/10.30 [2019-03-29 02:11:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 34 transitions. 21.97/10.30 [2019-03-29 02:11:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 7. 21.97/10.30 [2019-03-29 02:11:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 21.97/10.30 [2019-03-29 02:11:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. 21.97/10.30 [2019-03-29 02:11:02,907 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. 21.97/10.30 [2019-03-29 02:11:02,907 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. 21.97/10.30 [2019-03-29 02:11:02,907 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 21.97/10.30 [2019-03-29 02:11:02,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. 21.97/10.30 [2019-03-29 02:11:02,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 21.97/10.30 [2019-03-29 02:11:02,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:02,908 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:02,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.97/10.30 [2019-03-29 02:11:02,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.97/10.30 [2019-03-29 02:11:02,909 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 194#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 189#L10 21.97/10.30 [2019-03-29 02:11:02,909 INFO L796 eck$LassoCheckResult]: Loop: 189#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 190#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 195#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 189#L10 21.97/10.30 [2019-03-29 02:11:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:02,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:02,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash 59803, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:02,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:02,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash 59254520, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:02,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:02,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:02,950 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:02,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:02,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:02,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:02,951 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.97/10.30 [2019-03-29 02:11:02,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:02,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:02,951 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:02,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 21.97/10.30 [2019-03-29 02:11:02,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:02,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:02,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:02,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,002 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:03,002 INFO L412 LassoAnalysis]: Checking for nontermination... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:03,008 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:03,043 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:03,048 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.97/10.30 [2019-03-29 02:11:03,073 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:03,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:03,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:03,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:03,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.97/10.30 [2019-03-29 02:11:03,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:03,075 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:03,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 21.97/10.30 [2019-03-29 02:11:03,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:03,075 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:03,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,125 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:03,125 INFO L497 LassoAnalysis]: Using template 'affine'. 21.97/10.30 [2019-03-29 02:11:03,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:03,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:03,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.97/10.30 [2019-03-29 02:11:03,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:03,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:03,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:03,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:03,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:03,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.97/10.30 [2019-03-29 02:11:03,136 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.97/10.30 [2019-03-29 02:11:03,136 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 21.97/10.30 [2019-03-29 02:11:03,137 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.97/10.30 [2019-03-29 02:11:03,137 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.97/10.30 [2019-03-29 02:11:03,137 INFO L518 LassoAnalysis]: Proved termination. 21.97/10.30 [2019-03-29 02:11:03,137 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.97/10.30 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 21.97/10.30 Supporting invariants [] 21.97/10.30 [2019-03-29 02:11:03,138 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.97/10.30 [2019-03-29 02:11:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,164 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,212 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 21.97/10.30 [2019-03-29 02:11:03,213 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 21.97/10.30 [2019-03-29 02:11:03,213 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 6 Second operand 4 states. 21.97/10.30 [2019-03-29 02:11:03,355 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 63 states and 97 transitions. Complement of second has 50 states. 21.97/10.30 [2019-03-29 02:11:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states 21.97/10.30 [2019-03-29 02:11:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.97/10.30 [2019-03-29 02:11:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. 21.97/10.30 [2019-03-29 02:11:03,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 2 letters. Loop has 3 letters. 21.97/10.30 [2019-03-29 02:11:03,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:03,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. 21.97/10.30 [2019-03-29 02:11:03,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:03,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 2 letters. Loop has 6 letters. 21.97/10.30 [2019-03-29 02:11:03,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:03,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 97 transitions. 21.97/10.30 [2019-03-29 02:11:03,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 21.97/10.30 [2019-03-29 02:11:03,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 17 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:03,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 21.97/10.30 [2019-03-29 02:11:03,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 21.97/10.30 [2019-03-29 02:11:03,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:03,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:03,365 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 9. 21.97/10.30 [2019-03-29 02:11:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 21.97/10.30 [2019-03-29 02:11:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 21.97/10.30 [2019-03-29 02:11:03,367 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 21.97/10.30 [2019-03-29 02:11:03,367 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 21.97/10.30 [2019-03-29 02:11:03,367 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 21.97/10.30 [2019-03-29 02:11:03,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. 21.97/10.30 [2019-03-29 02:11:03,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 21.97/10.30 [2019-03-29 02:11:03,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:03,368 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:03,368 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.97/10.30 [2019-03-29 02:11:03,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 21.97/10.30 [2019-03-29 02:11:03,368 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 364#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 359#L10 21.97/10.30 [2019-03-29 02:11:03,369 INFO L796 eck$LassoCheckResult]: Loop: 359#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 360#L10-2 [43] L10-2-->L13-1: Formula: (and (> v_ULTIMATE.start_main_~i~0_9 30) (= v_ULTIMATE.start_main_~i~0_8 20)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 367#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 359#L10 21.97/10.30 [2019-03-29 02:11:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 2 times 21.97/10.30 [2019-03-29 02:11:03,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash 59989, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:03,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:03,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:03,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:03,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.97/10.30 [2019-03-29 02:11:03,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 21.97/10.30 [2019-03-29 02:11:03,410 INFO L811 eck$LassoCheckResult]: loop already infeasible 21.97/10.30 [2019-03-29 02:11:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.97/10.30 [2019-03-29 02:11:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.97/10.30 [2019-03-29 02:11:03,414 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. 21.97/10.30 [2019-03-29 02:11:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.97/10.30 [2019-03-29 02:11:03,434 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. 21.97/10.30 [2019-03-29 02:11:03,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.97/10.30 [2019-03-29 02:11:03,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. 21.97/10.30 [2019-03-29 02:11:03,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 21.97/10.30 [2019-03-29 02:11:03,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. 21.97/10.30 [2019-03-29 02:11:03,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 21.97/10.30 [2019-03-29 02:11:03,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 21.97/10.30 [2019-03-29 02:11:03,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. 21.97/10.30 [2019-03-29 02:11:03,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:03,437 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. 21.97/10.30 [2019-03-29 02:11:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. 21.97/10.30 [2019-03-29 02:11:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 21.97/10.30 [2019-03-29 02:11:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 21.97/10.30 [2019-03-29 02:11:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:03,439 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:03,439 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:03,439 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 21.97/10.30 [2019-03-29 02:11:03,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. 21.97/10.30 [2019-03-29 02:11:03,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 21.97/10.30 [2019-03-29 02:11:03,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:03,440 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:03,441 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.97/10.30 [2019-03-29 02:11:03,441 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] 21.97/10.30 [2019-03-29 02:11:03,441 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 391#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 386#L10 21.97/10.30 [2019-03-29 02:11:03,441 INFO L796 eck$LassoCheckResult]: Loop: 386#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 387#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 393#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 388#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 389#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 394#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 386#L10 21.97/10.30 [2019-03-29 02:11:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 3 times 21.97/10.30 [2019-03-29 02:11:03,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:03,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1781634639, now seen corresponding path program 1 times 21.97/10.30 [2019-03-29 02:11:03,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:03,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 19890130, now seen corresponding path program 2 times 21.97/10.30 [2019-03-29 02:11:03,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:03,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:03,488 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:03,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:03,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:03,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:03,489 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.97/10.30 [2019-03-29 02:11:03,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:03,489 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:03,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 21.97/10.30 [2019-03-29 02:11:03,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:03,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:03,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,528 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:03,528 INFO L412 LassoAnalysis]: Checking for nontermination... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:03,534 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:03,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:03,562 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:03,568 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:03,601 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:03,606 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.97/10.30 [2019-03-29 02:11:03,630 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:03,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:03,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:03,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:03,630 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.97/10.30 [2019-03-29 02:11:03,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:03,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:03,631 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:03,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 21.97/10.30 [2019-03-29 02:11:03,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:03,631 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:03,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:03,681 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:03,681 INFO L497 LassoAnalysis]: Using template 'affine'. 21.97/10.30 [2019-03-29 02:11:03,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:03,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:03,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.97/10.30 [2019-03-29 02:11:03,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:03,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:03,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:03,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:03,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:03,688 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.97/10.30 [2019-03-29 02:11:03,691 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.97/10.30 [2019-03-29 02:11:03,691 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 21.97/10.30 [2019-03-29 02:11:03,691 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.97/10.30 [2019-03-29 02:11:03,691 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.97/10.30 [2019-03-29 02:11:03,692 INFO L518 LassoAnalysis]: Proved termination. 21.97/10.30 [2019-03-29 02:11:03,692 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.97/10.30 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 53 21.97/10.30 Supporting invariants [] 21.97/10.30 [2019-03-29 02:11:03,692 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.97/10.30 [2019-03-29 02:11:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:03,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:03,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:03,974 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization 21.97/10.30 [2019-03-29 02:11:03,974 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 21.97/10.30 [2019-03-29 02:11:03,974 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 5 states. 21.97/10.30 [2019-03-29 02:11:04,295 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 148 states and 190 transitions. Complement of second has 120 states. 21.97/10.30 [2019-03-29 02:11:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 2 accepting loop states 21.97/10.30 [2019-03-29 02:11:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 21.97/10.30 [2019-03-29 02:11:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. 21.97/10.30 [2019-03-29 02:11:04,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 2 letters. Loop has 6 letters. 21.97/10.30 [2019-03-29 02:11:04,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:04,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 8 letters. Loop has 6 letters. 21.97/10.30 [2019-03-29 02:11:04,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:04,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 2 letters. Loop has 12 letters. 21.97/10.30 [2019-03-29 02:11:04,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:04,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 190 transitions. 21.97/10.30 [2019-03-29 02:11:04,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 21.97/10.30 [2019-03-29 02:11:04,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 36 states and 52 transitions. 21.97/10.30 [2019-03-29 02:11:04,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 21.97/10.30 [2019-03-29 02:11:04,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 21.97/10.30 [2019-03-29 02:11:04,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 52 transitions. 21.97/10.30 [2019-03-29 02:11:04,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:04,310 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. 21.97/10.30 [2019-03-29 02:11:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 52 transitions. 21.97/10.30 [2019-03-29 02:11:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. 21.97/10.30 [2019-03-29 02:11:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 21.97/10.30 [2019-03-29 02:11:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. 21.97/10.30 [2019-03-29 02:11:04,313 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 21.97/10.30 [2019-03-29 02:11:04,313 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 21.97/10.30 [2019-03-29 02:11:04,313 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 21.97/10.30 [2019-03-29 02:11:04,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. 21.97/10.30 [2019-03-29 02:11:04,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 21.97/10.30 [2019-03-29 02:11:04,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:04,314 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:04,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.97/10.30 [2019-03-29 02:11:04,315 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] 21.97/10.30 [2019-03-29 02:11:04,315 INFO L794 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 794#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 789#L10 21.97/10.30 [2019-03-29 02:11:04,315 INFO L796 eck$LassoCheckResult]: Loop: 789#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 790#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 805#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 803#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 800#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 796#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 797#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 802#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 804#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 789#L10 21.97/10.30 [2019-03-29 02:11:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 4 times 21.97/10.30 [2019-03-29 02:11:04,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:04,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash -528270053, now seen corresponding path program 2 times 21.97/10.30 [2019-03-29 02:11:04,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:04,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -158580552, now seen corresponding path program 3 times 21.97/10.30 [2019-03-29 02:11:04,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,392 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:04,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:04,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:04,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:04,393 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.97/10.30 [2019-03-29 02:11:04,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:04,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:04,393 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:04,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 21.97/10.30 [2019-03-29 02:11:04,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:04,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:04,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:04,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:04,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:04,440 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:04,440 INFO L412 LassoAnalysis]: Checking for nontermination... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:04,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:04,445 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:04,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:04,472 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:04,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:04,478 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:04,506 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.97/10.30 [2019-03-29 02:11:04,506 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:04,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:04,512 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:04,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:04,545 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:04,550 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.97/10.30 [2019-03-29 02:11:04,575 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:04,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:04,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:04,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:04,576 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.97/10.30 [2019-03-29 02:11:04,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:04,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:04,576 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:04,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 21.97/10.30 [2019-03-29 02:11:04,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:04,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:04,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:04,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:04,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:04,616 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:04,616 INFO L497 LassoAnalysis]: Using template 'affine'. 21.97/10.30 [2019-03-29 02:11:04,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:04,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:04,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:04,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:04,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:04,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:04,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:04,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.97/10.30 [2019-03-29 02:11:04,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:04,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:04,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.97/10.30 [2019-03-29 02:11:04,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:04,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:04,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:04,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:04,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:04,627 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.97/10.30 [2019-03-29 02:11:04,630 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.97/10.30 [2019-03-29 02:11:04,630 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 21.97/10.30 [2019-03-29 02:11:04,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.97/10.30 [2019-03-29 02:11:04,630 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.97/10.30 [2019-03-29 02:11:04,630 INFO L518 LassoAnalysis]: Proved termination. 21.97/10.30 [2019-03-29 02:11:04,630 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.97/10.30 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 21.97/10.30 Supporting invariants [] 21.97/10.30 [2019-03-29 02:11:04,631 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.97/10.30 [2019-03-29 02:11:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:04,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:04,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:04,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:04,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,744 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,749 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:04,754 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:04,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:04,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:04,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:04,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:04,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:04,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:04,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:04,847 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 8 predicates after loop cannibalization 21.97/10.30 [2019-03-29 02:11:04,848 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 8 loop predicates 21.97/10.30 [2019-03-29 02:11:04,848 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. 21.97/10.30 [2019-03-29 02:11:05,056 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 250 states and 306 transitions. Complement of second has 152 states. 21.97/10.30 [2019-03-29 02:11:05,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 8 non-accepting loop states 2 accepting loop states 21.97/10.30 [2019-03-29 02:11:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 21.97/10.30 [2019-03-29 02:11:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. 21.97/10.30 [2019-03-29 02:11:05,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 2 letters. Loop has 9 letters. 21.97/10.30 [2019-03-29 02:11:05,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:05,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 11 letters. Loop has 9 letters. 21.97/10.30 [2019-03-29 02:11:05,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:05,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 2 letters. Loop has 18 letters. 21.97/10.30 [2019-03-29 02:11:05,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:05,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250 states and 306 transitions. 21.97/10.30 [2019-03-29 02:11:05,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 21.97/10.30 [2019-03-29 02:11:05,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250 states to 38 states and 54 transitions. 21.97/10.30 [2019-03-29 02:11:05,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 21.97/10.30 [2019-03-29 02:11:05,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 21.97/10.30 [2019-03-29 02:11:05,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 54 transitions. 21.97/10.30 [2019-03-29 02:11:05,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:05,070 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 54 transitions. 21.97/10.30 [2019-03-29 02:11:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 54 transitions. 21.97/10.30 [2019-03-29 02:11:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 20. 21.97/10.30 [2019-03-29 02:11:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 21.97/10.30 [2019-03-29 02:11:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:05,073 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:05,073 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:05,073 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 21.97/10.30 [2019-03-29 02:11:05,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. 21.97/10.30 [2019-03-29 02:11:05,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 21.97/10.30 [2019-03-29 02:11:05,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:05,074 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:05,074 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.97/10.30 [2019-03-29 02:11:05,074 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] 21.97/10.30 [2019-03-29 02:11:05,075 INFO L794 eck$LassoCheckResult]: Stem: 1384#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1385#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1380#L10 21.97/10.30 [2019-03-29 02:11:05,075 INFO L796 eck$LassoCheckResult]: Loop: 1380#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1381#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1387#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1388#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1398#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1399#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1382#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1383#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1393#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1395#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1394#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1397#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1380#L10 21.97/10.30 [2019-03-29 02:11:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 5 times 21.97/10.30 [2019-03-29 02:11:05,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -932932913, now seen corresponding path program 3 times 21.97/10.30 [2019-03-29 02:11:05,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:05,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:05,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash 190844434, now seen corresponding path program 4 times 21.97/10.30 [2019-03-29 02:11:05,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:05,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,141 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:05,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:05,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:05,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:05,141 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.97/10.30 [2019-03-29 02:11:05,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:05,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:05,142 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:05,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 21.97/10.30 [2019-03-29 02:11:05,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:05,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:05,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:05,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:05,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:05,195 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:05,195 INFO L412 LassoAnalysis]: Checking for nontermination... 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:05,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:05,202 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.97/10.30 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.97/10.30 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:05,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.97/10.30 [2019-03-29 02:11:05,237 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.97/10.30 [2019-03-29 02:11:05,241 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.97/10.30 [2019-03-29 02:11:05,266 INFO L216 LassoAnalysis]: Preferences: 21.97/10.30 [2019-03-29 02:11:05,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.97/10.30 [2019-03-29 02:11:05,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.97/10.30 [2019-03-29 02:11:05,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.97/10.30 [2019-03-29 02:11:05,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.97/10.30 [2019-03-29 02:11:05,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.97/10.30 [2019-03-29 02:11:05,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.97/10.30 [2019-03-29 02:11:05,267 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.97/10.30 [2019-03-29 02:11:05,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 21.97/10.30 [2019-03-29 02:11:05,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.97/10.30 [2019-03-29 02:11:05,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.97/10.30 [2019-03-29 02:11:05,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:05,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:05,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.97/10.30 [2019-03-29 02:11:05,307 INFO L300 LassoAnalysis]: Preprocessing complete. 21.97/10.30 [2019-03-29 02:11:05,307 INFO L497 LassoAnalysis]: Using template 'affine'. 21.97/10.30 [2019-03-29 02:11:05,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.97/10.30 Termination analysis: LINEAR_WITH_GUESSES 21.97/10.30 Number of strict supporting invariants: 0 21.97/10.30 Number of non-strict supporting invariants: 1 21.97/10.30 Consider only non-deceasing supporting invariants: true 21.97/10.30 Simplify termination arguments: true 21.97/10.30 Simplify supporting invariants: trueOverapproximate stem: false 21.97/10.30 [2019-03-29 02:11:05,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.97/10.30 [2019-03-29 02:11:05,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.97/10.30 [2019-03-29 02:11:05,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.97/10.30 [2019-03-29 02:11:05,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.97/10.30 [2019-03-29 02:11:05,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.97/10.30 [2019-03-29 02:11:05,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.97/10.30 [2019-03-29 02:11:05,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.97/10.30 [2019-03-29 02:11:05,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.97/10.30 [2019-03-29 02:11:05,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 21.97/10.30 [2019-03-29 02:11:05,314 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 21.97/10.30 [2019-03-29 02:11:05,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.97/10.30 [2019-03-29 02:11:05,315 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.97/10.30 [2019-03-29 02:11:05,315 INFO L518 LassoAnalysis]: Proved termination. 21.97/10.30 [2019-03-29 02:11:05,315 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.97/10.30 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 21.97/10.30 Supporting invariants [] 21.97/10.30 [2019-03-29 02:11:05,315 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.97/10.30 [2019-03-29 02:11:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:05,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:05,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:05,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:05,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.97/10.30 [2019-03-29 02:11:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,536 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,541 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,549 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,555 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,560 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,566 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,572 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,579 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,585 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 21.97/10.30 [2019-03-29 02:11:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.97/10.30 [2019-03-29 02:11:05,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core 21.97/10.30 [2019-03-29 02:11:05,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.97/10.30 [2019-03-29 02:11:05,617 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 21.97/10.30 [2019-03-29 02:11:05,617 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 21.97/10.30 [2019-03-29 02:11:05,618 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 29 transitions. cyclomatic complexity: 10 Second operand 7 states. 21.97/10.30 [2019-03-29 02:11:05,888 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 29 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 151 states and 183 transitions. Complement of second has 98 states. 21.97/10.30 [2019-03-29 02:11:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 7 non-accepting loop states 3 accepting loop states 21.97/10.30 [2019-03-29 02:11:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 21.97/10.30 [2019-03-29 02:11:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. 21.97/10.30 [2019-03-29 02:11:05,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 2 letters. Loop has 12 letters. 21.97/10.30 [2019-03-29 02:11:05,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:05,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 14 letters. Loop has 12 letters. 21.97/10.30 [2019-03-29 02:11:05,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:05,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. 21.97/10.30 [2019-03-29 02:11:05,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.97/10.30 [2019-03-29 02:11:05,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 183 transitions. 21.97/10.30 [2019-03-29 02:11:05,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 21.97/10.30 [2019-03-29 02:11:05,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 34 states and 47 transitions. 21.97/10.30 [2019-03-29 02:11:05,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 21.97/10.30 [2019-03-29 02:11:05,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 21.97/10.30 [2019-03-29 02:11:05,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. 21.97/10.30 [2019-03-29 02:11:05,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.97/10.30 [2019-03-29 02:11:05,897 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. 21.97/10.30 [2019-03-29 02:11:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. 21.97/10.30 [2019-03-29 02:11:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. 21.97/10.30 [2019-03-29 02:11:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 21.97/10.30 [2019-03-29 02:11:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. 21.97/10.30 [2019-03-29 02:11:05,899 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. 21.97/10.30 [2019-03-29 02:11:05,899 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. 21.97/10.30 [2019-03-29 02:11:05,900 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 21.97/10.30 [2019-03-29 02:11:05,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. 21.97/10.30 [2019-03-29 02:11:05,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 21.97/10.30 [2019-03-29 02:11:05,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.97/10.30 [2019-03-29 02:11:05,900 INFO L119 BuchiIsEmpty]: Starting construction of run 21.97/10.30 [2019-03-29 02:11:05,901 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 21.97/10.30 [2019-03-29 02:11:05,901 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] 21.97/10.30 [2019-03-29 02:11:05,901 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1772#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1767#L10 21.97/10.30 [2019-03-29 02:11:05,901 INFO L796 eck$LassoCheckResult]: Loop: 1767#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1768#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1774#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1775#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1776#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1777#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1789#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1788#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1787#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1769#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1770#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1782#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1784#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1783#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1786#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1767#L10 21.97/10.30 [2019-03-29 02:11:05,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 6 times 21.97/10.30 [2019-03-29 02:11:05,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash -270995301, now seen corresponding path program 4 times 21.97/10.30 [2019-03-29 02:11:05,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.97/10.30 [2019-03-29 02:11:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1090123144, now seen corresponding path program 5 times 21.97/10.30 [2019-03-29 02:11:05,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.97/10.30 [2019-03-29 02:11:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.97/10.30 [2019-03-29 02:11:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.97/10.30 [2019-03-29 02:11:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.97/10.30 [2019-03-29 02:11:06,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:11:06 BasicIcfg 21.97/10.30 [2019-03-29 02:11:06,013 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 21.97/10.30 [2019-03-29 02:11:06,013 INFO L168 Benchmark]: Toolchain (without parser) took 5547.46 ms. Allocated memory was 649.6 MB in the beginning and 781.7 MB in the end (delta: 132.1 MB). Free memory was 566.0 MB in the beginning and 629.2 MB in the end (delta: -63.2 MB). Peak memory consumption was 69.0 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,015 INFO L168 Benchmark]: CDTParser took 0.17 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. 21.97/10.30 [2019-03-29 02:11:06,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.34 ms. Allocated memory is still 649.6 MB. Free memory was 566.0 MB in the beginning and 556.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.62 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 556.3 MB in the beginning and 645.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,017 INFO L168 Benchmark]: Boogie Preprocessor took 20.81 ms. Allocated memory is still 680.0 MB. Free memory was 645.3 MB in the beginning and 642.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,017 INFO L168 Benchmark]: RCFGBuilder took 210.25 ms. Allocated memory is still 680.0 MB. Free memory was 642.5 MB in the beginning and 630.0 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,018 INFO L168 Benchmark]: BlockEncodingV2 took 84.09 ms. Allocated memory is still 680.0 MB. Free memory was 630.0 MB in the beginning and 624.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,018 INFO L168 Benchmark]: TraceAbstraction took 156.20 ms. Allocated memory is still 680.0 MB. Free memory was 624.6 MB in the beginning and 615.9 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,019 INFO L168 Benchmark]: BuchiAutomizer took 4738.70 ms. Allocated memory was 680.0 MB in the beginning and 781.7 MB in the end (delta: 101.7 MB). Free memory was 614.8 MB in the beginning and 629.2 MB in the end (delta: -14.4 MB). Peak memory consumption was 87.3 MB. Max. memory is 50.3 GB. 21.97/10.30 [2019-03-29 02:11:06,024 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 21.97/10.30 --- Results --- 21.97/10.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 21.97/10.30 - StatisticsResult: Initial Icfg 21.97/10.30 8 locations, 11 edges 21.97/10.30 - StatisticsResult: Encoded RCFG 21.97/10.30 4 locations, 7 edges 21.97/10.30 * Results from de.uni_freiburg.informatik.ultimate.core: 21.97/10.30 - StatisticsResult: Toolchain Benchmarks 21.97/10.30 Benchmark results are: 21.97/10.30 * CDTParser took 0.17 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. 21.97/10.30 * CACSL2BoogieTranslator took 228.34 ms. Allocated memory is still 649.6 MB. Free memory was 566.0 MB in the beginning and 556.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 21.97/10.30 * Boogie Procedure Inliner took 103.62 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 556.3 MB in the beginning and 645.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 50.3 GB. 21.97/10.30 * Boogie Preprocessor took 20.81 ms. Allocated memory is still 680.0 MB. Free memory was 645.3 MB in the beginning and 642.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 21.97/10.30 * RCFGBuilder took 210.25 ms. Allocated memory is still 680.0 MB. Free memory was 642.5 MB in the beginning and 630.0 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 50.3 GB. 21.97/10.30 * BlockEncodingV2 took 84.09 ms. Allocated memory is still 680.0 MB. Free memory was 630.0 MB in the beginning and 624.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 21.97/10.30 * TraceAbstraction took 156.20 ms. Allocated memory is still 680.0 MB. Free memory was 624.6 MB in the beginning and 615.9 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 21.97/10.30 * BuchiAutomizer took 4738.70 ms. Allocated memory was 680.0 MB in the beginning and 781.7 MB in the end (delta: 101.7 MB). Free memory was 614.8 MB in the beginning and 629.2 MB in the end (delta: -14.4 MB). Peak memory consumption was 87.3 MB. Max. memory is 50.3 GB. 21.97/10.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 21.97/10.30 - AllSpecificationsHoldResult: All specifications hold 21.97/10.30 We were not able to verify any specifiation because the program does not contain any specification. 21.97/10.30 - InvariantResult [Line: 9]: Loop Invariant 21.97/10.30 Derived loop invariant: 1 21.97/10.30 - StatisticsResult: Ultimate Automizer benchmark data 21.97/10.30 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 21.97/10.30 - StatisticsResult: Constructed decomposition of program 21.97/10.30 Your program was decomposed into 7 terminating modules (1 trivial, 0 deterministic, 6 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + 27 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 53 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 12 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 12 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 23 locations. 21.97/10.30 - StatisticsResult: Timing statistics 21.97/10.30 BüchiAutomizer plugin needed 4.6s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 7. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/30 HoareTripleCheckerStatistics: 31 SDtfs, 113 SDslu, 0 SDs, 0 SdLazy, 407 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax230 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf89 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s 21.97/10.30 - TerminationAnalysisResult: Nontermination possible 21.97/10.30 Buchi Automizer proved that your program is nonterminating for some inputs 21.97/10.30 - FixpointNonTerminationResult [Line: 10]: Nontermination argument in form of an infinite program execution. 21.97/10.30 Nontermination argument in form of an infinite execution 21.97/10.30 State at position 0 is 21.97/10.30 {} 21.97/10.30 State at position 1 is 21.97/10.30 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1eb1f28a=0, \result=0, i=25} 21.97/10.30 - StatisticsResult: NonterminationArgumentStatistics 21.97/10.30 Fixpoint 21.97/10.30 - NonterminatingLassoResult [Line: 10]: Nonterminating execution 21.97/10.30 Found a nonterminating execution for the following lasso shaped sequence of statements. 21.97/10.30 Stem: 21.97/10.30 [L6] int i; 21.97/10.30 [L7] i = __VERIFIER_nondet_int() 21.97/10.30 [L9] COND TRUE i > 10 21.97/10.30 Loop: 21.97/10.30 [L10] COND TRUE i == 25 21.97/10.30 [L11] i = 30 21.97/10.30 [L13] COND TRUE i <= 30 21.97/10.30 [L14] i = i-1 21.97/10.30 [L9] COND TRUE i > 10 21.97/10.30 [L10] COND FALSE !(i == 25) 21.97/10.30 [L13] COND TRUE i <= 30 21.97/10.30 [L14] i = i-1 21.97/10.30 [L9] COND TRUE i > 10 21.97/10.30 [L10] COND FALSE !(i == 25) 21.97/10.30 [L13] COND TRUE i <= 30 21.97/10.30 [L14] i = i-1 21.97/10.30 [L9] COND TRUE i > 10 21.97/10.30 [L10] COND FALSE !(i == 25) 21.97/10.30 [L13] COND TRUE i <= 30 21.97/10.30 [L14] i = i-1 21.97/10.30 [L9] COND TRUE i > 10 21.97/10.30 [L10] COND FALSE !(i == 25) 21.97/10.30 [L13] COND TRUE i <= 30 21.97/10.30 [L14] i = i-1 21.97/10.30 [L9] COND TRUE i > 10 21.97/10.30 End of lasso representation. 21.97/10.30 RESULT: Ultimate proved your program to be incorrect! 21.97/10.30 !SESSION 2019-03-29 02:10:56.805 ----------------------------------------------- 21.97/10.30 eclipse.buildId=unknown 21.97/10.30 java.version=1.8.0_181 21.97/10.30 java.vendor=Oracle Corporation 21.97/10.30 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 21.97/10.30 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.97/10.30 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 21.97/10.30 21.97/10.30 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 02:11:06.262 21.97/10.30 !MESSAGE The workspace will exit with unsaved changes in this session. 21.97/10.30 Received shutdown request... 21.97/10.30 Ultimate: 21.97/10.30 GTK+ Version Check 21.97/10.30 EOF