20.86/10.66 YES 20.86/10.66 20.86/10.66 Ultimate: Cannot open display: 20.86/10.66 This is Ultimate 0.1.24-8dc7c08-m 20.86/10.66 [2019-03-28 11:57:45,607 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.86/10.66 [2019-03-28 11:57:45,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.86/10.66 [2019-03-28 11:57:45,620 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,621 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.86/10.66 [2019-03-28 11:57:45,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.86/10.66 [2019-03-28 11:57:45,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.86/10.66 [2019-03-28 11:57:45,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.86/10.66 [2019-03-28 11:57:45,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.86/10.66 [2019-03-28 11:57:45,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.86/10.66 [2019-03-28 11:57:45,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.86/10.66 [2019-03-28 11:57:45,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.86/10.66 [2019-03-28 11:57:45,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.86/10.66 [2019-03-28 11:57:45,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.86/10.66 [2019-03-28 11:57:45,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.86/10.66 [2019-03-28 11:57:45,632 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.86/10.66 [2019-03-28 11:57:45,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.86/10.66 [2019-03-28 11:57:45,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.86/10.66 [2019-03-28 11:57:45,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.86/10.66 [2019-03-28 11:57:45,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.86/10.66 [2019-03-28 11:57:45,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.86/10.66 [2019-03-28 11:57:45,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.86/10.66 [2019-03-28 11:57:45,642 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.86/10.66 [2019-03-28 11:57:45,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.86/10.66 [2019-03-28 11:57:45,644 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.86/10.66 [2019-03-28 11:57:45,645 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.86/10.66 [2019-03-28 11:57:45,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.86/10.66 [2019-03-28 11:57:45,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.86/10.66 [2019-03-28 11:57:45,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.86/10.66 [2019-03-28 11:57:45,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,648 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.86/10.66 [2019-03-28 11:57:45,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.86/10.66 [2019-03-28 11:57:45,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.86/10.66 [2019-03-28 11:57:45,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.86/10.66 [2019-03-28 11:57:45,650 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 20.86/10.66 [2019-03-28 11:57:45,665 INFO L110 SettingsManager]: Loading preferences was successful 20.86/10.66 [2019-03-28 11:57:45,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.86/10.66 [2019-03-28 11:57:45,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.86/10.66 [2019-03-28 11:57:45,666 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.86/10.66 [2019-03-28 11:57:45,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.86/10.66 [2019-03-28 11:57:45,667 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.86/10.66 [2019-03-28 11:57:45,667 INFO L133 SettingsManager]: * Use SBE=true 20.86/10.66 [2019-03-28 11:57:45,667 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.86/10.66 [2019-03-28 11:57:45,667 INFO L133 SettingsManager]: * Use old map elimination=false 20.86/10.66 [2019-03-28 11:57:45,667 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.86/10.66 [2019-03-28 11:57:45,668 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.86/10.66 [2019-03-28 11:57:45,668 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.86/10.66 [2019-03-28 11:57:45,668 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.86/10.66 [2019-03-28 11:57:45,668 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.86/10.66 [2019-03-28 11:57:45,668 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:45,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.86/10.66 [2019-03-28 11:57:45,669 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.86/10.66 [2019-03-28 11:57:45,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.86/10.66 [2019-03-28 11:57:45,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.86/10.66 [2019-03-28 11:57:45,669 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.86/10.66 [2019-03-28 11:57:45,669 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.86/10.66 [2019-03-28 11:57:45,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.86/10.66 [2019-03-28 11:57:45,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.86/10.66 [2019-03-28 11:57:45,670 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.86/10.66 [2019-03-28 11:57:45,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.86/10.66 [2019-03-28 11:57:45,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.86/10.66 [2019-03-28 11:57:45,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.86/10.66 [2019-03-28 11:57:45,671 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.86/10.66 [2019-03-28 11:57:45,671 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.86/10.66 [2019-03-28 11:57:45,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.86/10.66 [2019-03-28 11:57:45,710 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.86/10.66 [2019-03-28 11:57:45,713 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.86/10.66 [2019-03-28 11:57:45,715 INFO L271 PluginConnector]: Initializing CDTParser... 20.86/10.66 [2019-03-28 11:57:45,715 INFO L276 PluginConnector]: CDTParser initialized 20.86/10.66 [2019-03-28 11:57:45,716 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 20.86/10.66 [2019-03-28 11:57:45,790 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/43f7d441ddb54abf8ab2c7cac4f75167/FLAGa5639186b 20.86/10.66 [2019-03-28 11:57:46,750 INFO L307 CDTParser]: Found 1 translation units. 20.86/10.66 [2019-03-28 11:57:46,750 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 20.86/10.66 [2019-03-28 11:57:46,864 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/43f7d441ddb54abf8ab2c7cac4f75167/FLAGa5639186b 20.86/10.66 [2019-03-28 11:57:47,162 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/43f7d441ddb54abf8ab2c7cac4f75167 20.86/10.66 [2019-03-28 11:57:47,173 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.86/10.66 [2019-03-28 11:57:47,175 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.86/10.66 [2019-03-28 11:57:47,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.86/10.66 [2019-03-28 11:57:47,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.86/10.66 [2019-03-28 11:57:47,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.86/10.66 [2019-03-28 11:57:47,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec03a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.86/10.66 [2019-03-28 11:57:47,212 INFO L176 MainTranslator]: Built tables and reachable declarations 20.86/10.66 [2019-03-28 11:57:47,373 INFO L206 PostProcessor]: Analyzing one entry point: main 20.86/10.66 [2019-03-28 11:57:47,378 INFO L191 MainTranslator]: Completed pre-run 20.86/10.66 [2019-03-28 11:57:47,395 INFO L206 PostProcessor]: Analyzing one entry point: main 20.86/10.66 [2019-03-28 11:57:47,411 INFO L195 MainTranslator]: Completed translation 20.86/10.66 [2019-03-28 11:57:47,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47 WrapperNode 20.86/10.66 [2019-03-28 11:57:47,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.86/10.66 [2019-03-28 11:57:47,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.86/10.66 [2019-03-28 11:57:47,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.86/10.66 [2019-03-28 11:57:47,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.86/10.66 [2019-03-28 11:57:47,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.86/10.66 [2019-03-28 11:57:47,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.86/10.66 [2019-03-28 11:57:47,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.86/10.66 [2019-03-28 11:57:47,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.86/10.66 [2019-03-28 11:57:47,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.86/10.66 [2019-03-28 11:57:47,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.86/10.66 [2019-03-28 11:57:47,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.86/10.66 [2019-03-28 11:57:47,528 INFO L276 PluginConnector]: RCFGBuilder initialized 20.86/10.66 [2019-03-28 11:57:47,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (1/1) ... 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.86/10.66 [2019-03-28 11:57:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.86/10.66 [2019-03-28 11:57:47,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.86/10.66 [2019-03-28 11:57:47,723 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.86/10.66 [2019-03-28 11:57:47,723 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.86/10.66 [2019-03-28 11:57:47,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:47 BoogieIcfgContainer 20.86/10.66 [2019-03-28 11:57:47,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.86/10.66 [2019-03-28 11:57:47,725 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.86/10.66 [2019-03-28 11:57:47,726 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.86/10.66 [2019-03-28 11:57:47,728 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.86/10.66 [2019-03-28 11:57:47,729 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:47" (1/1) ... 20.86/10.66 [2019-03-28 11:57:47,744 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges 20.86/10.66 [2019-03-28 11:57:47,745 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.86/10.66 [2019-03-28 11:57:47,746 INFO L263 BlockEncoder]: Using Maximize final states 20.86/10.66 [2019-03-28 11:57:47,747 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.86/10.66 [2019-03-28 11:57:47,747 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.86/10.66 [2019-03-28 11:57:47,749 INFO L296 BlockEncoder]: Using Remove sink states 20.86/10.66 [2019-03-28 11:57:47,750 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.86/10.66 [2019-03-28 11:57:47,750 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.86/10.66 [2019-03-28 11:57:47,766 INFO L185 BlockEncoder]: Using Use SBE 20.86/10.66 [2019-03-28 11:57:47,781 INFO L200 BlockEncoder]: SBE split 2 edges 20.86/10.66 [2019-03-28 11:57:47,786 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.86/10.66 [2019-03-28 11:57:47,788 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.86/10.66 [2019-03-28 11:57:47,796 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 20.86/10.66 [2019-03-28 11:57:47,798 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 20.86/10.66 [2019-03-28 11:57:47,799 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.86/10.66 [2019-03-28 11:57:47,800 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.86/10.66 [2019-03-28 11:57:47,800 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.86/10.66 [2019-03-28 11:57:47,800 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.86/10.66 [2019-03-28 11:57:47,800 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 11 edges 20.86/10.66 [2019-03-28 11:57:47,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:57:47 BasicIcfg 20.86/10.66 [2019-03-28 11:57:47,801 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.86/10.66 [2019-03-28 11:57:47,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.86/10.66 [2019-03-28 11:57:47,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.86/10.66 [2019-03-28 11:57:47,805 INFO L276 PluginConnector]: TraceAbstraction initialized 20.86/10.66 [2019-03-28 11:57:47,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:57:47" (1/4) ... 20.86/10.66 [2019-03-28 11:57:47,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef24927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (2/4) ... 20.86/10.66 [2019-03-28 11:57:47,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef24927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:47" (3/4) ... 20.86/10.66 [2019-03-28 11:57:47,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef24927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:57:47" (4/4) ... 20.86/10.66 [2019-03-28 11:57:47,809 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.86/10.66 [2019-03-28 11:57:47,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.86/10.66 [2019-03-28 11:57:47,827 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.86/10.66 [2019-03-28 11:57:47,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.86/10.66 [2019-03-28 11:57:47,873 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.86/10.66 [2019-03-28 11:57:47,874 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.86/10.66 [2019-03-28 11:57:47,874 INFO L383 AbstractCegarLoop]: Hoare is true 20.86/10.66 [2019-03-28 11:57:47,874 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.86/10.66 [2019-03-28 11:57:47,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.86/10.66 [2019-03-28 11:57:47,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.86/10.66 [2019-03-28 11:57:47,875 INFO L387 AbstractCegarLoop]: Difference is false 20.86/10.66 [2019-03-28 11:57:47,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.86/10.66 [2019-03-28 11:57:47,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.86/10.66 [2019-03-28 11:57:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. 20.86/10.66 [2019-03-28 11:57:47,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.86/10.66 [2019-03-28 11:57:47,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. 20.86/10.66 [2019-03-28 11:57:47,949 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. 20.86/10.66 [2019-03-28 11:57:47,949 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.86/10.66 [2019-03-28 11:57:47,949 INFO L448 ceAbstractionStarter]: For program point L30-2(lines 30 34) no Hoare annotation was computed. 20.86/10.66 [2019-03-28 11:57:47,950 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 27) no Hoare annotation was computed. 20.86/10.66 [2019-03-28 11:57:47,950 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 36) no Hoare annotation was computed. 20.86/10.66 [2019-03-28 11:57:47,950 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 27) no Hoare annotation was computed. 20.86/10.66 [2019-03-28 11:57:47,950 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 21 37) the Hoare annotation is: true 20.86/10.66 [2019-03-28 11:57:47,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:57:47 BasicIcfg 20.86/10.66 [2019-03-28 11:57:47,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.86/10.66 [2019-03-28 11:57:47,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.86/10.66 [2019-03-28 11:57:47,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.86/10.66 [2019-03-28 11:57:47,963 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.86/10.66 [2019-03-28 11:57:47,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.86/10.66 [2019-03-28 11:57:47,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:57:47" (1/5) ... 20.86/10.66 [2019-03-28 11:57:47,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aa73e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.86/10.66 [2019-03-28 11:57:47,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:47" (2/5) ... 20.86/10.66 [2019-03-28 11:57:47,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aa73e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.86/10.66 [2019-03-28 11:57:47,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:47" (3/5) ... 20.86/10.66 [2019-03-28 11:57:47,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aa73e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.86/10.66 [2019-03-28 11:57:47,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:57:47" (4/5) ... 20.86/10.66 [2019-03-28 11:57:47,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aa73e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:57:47, skipping insertion in model container 20.86/10.66 [2019-03-28 11:57:47,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.86/10.66 [2019-03-28 11:57:47,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:57:47" (5/5) ... 20.86/10.66 [2019-03-28 11:57:47,968 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.86/10.66 [2019-03-28 11:57:47,995 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.86/10.66 [2019-03-28 11:57:47,995 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.86/10.66 [2019-03-28 11:57:47,996 INFO L375 BuchiCegarLoop]: Hoare is true 20.86/10.66 [2019-03-28 11:57:47,996 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.86/10.66 [2019-03-28 11:57:47,996 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.86/10.66 [2019-03-28 11:57:47,996 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.86/10.66 [2019-03-28 11:57:47,996 INFO L379 BuchiCegarLoop]: Difference is false 20.86/10.66 [2019-03-28 11:57:47,996 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.86/10.66 [2019-03-28 11:57:47,996 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.86/10.66 [2019-03-28 11:57:48,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 20.86/10.66 [2019-03-28 11:57:48,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.86/10.66 [2019-03-28 11:57:48,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.86/10.66 [2019-03-28 11:57:48,018 INFO L119 BuchiIsEmpty]: Starting construction of run 20.86/10.66 [2019-03-28 11:57:48,024 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.86/10.66 [2019-03-28 11:57:48,024 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:48,024 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.86/10.66 [2019-03-28 11:57:48,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 20.86/10.66 [2019-03-28 11:57:48,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.86/10.66 [2019-03-28 11:57:48,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.86/10.66 [2019-03-28 11:57:48,026 INFO L119 BuchiIsEmpty]: Starting construction of run 20.86/10.66 [2019-03-28 11:57:48,026 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.86/10.66 [2019-03-28 11:57:48,026 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:48,031 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [37] ULTIMATE.startENTRY-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 9#L22-2true 20.86/10.66 [2019-03-28 11:57:48,032 INFO L796 eck$LassoCheckResult]: Loop: 9#L22-2true [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 5#L22true [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 7#L23true [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 3#L23-2true [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 9#L22-2true 20.86/10.66 [2019-03-28 11:57:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:48,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:48,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2438744, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:48,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash 64314651, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:48,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:48,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,211 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:48,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:48,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:48,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:48,213 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.86/10.66 [2019-03-28 11:57:48,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:48,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:48,213 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:48,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.86/10.66 [2019-03-28 11:57:48,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:48,214 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:48,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:48,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:48,330 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:48,331 INFO L412 LassoAnalysis]: Checking for nontermination... 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:48,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:48,338 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:48,372 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:48,372 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 [2019-03-28 11:57:48,409 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.86/10.66 [2019-03-28 11:57:48,411 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:48,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:48,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:48,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:48,412 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.86/10.66 [2019-03-28 11:57:48,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:48,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:48,412 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:48,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.86/10.66 [2019-03-28 11:57:48,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:48,412 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:48,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:48,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:48,485 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:48,492 INFO L497 LassoAnalysis]: Using template 'affine'. 20.86/10.66 [2019-03-28 11:57:48,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.66 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.66 Number of strict supporting invariants: 0 20.86/10.66 Number of non-strict supporting invariants: 1 20.86/10.66 Consider only non-deceasing supporting invariants: true 20.86/10.66 Simplify termination arguments: true 20.86/10.66 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.66 [2019-03-28 11:57:48,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.66 [2019-03-28 11:57:48,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.66 [2019-03-28 11:57:48,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.66 [2019-03-28 11:57:48,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.66 [2019-03-28 11:57:48,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.66 [2019-03-28 11:57:48,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.66 [2019-03-28 11:57:48,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.66 [2019-03-28 11:57:48,511 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.86/10.66 [2019-03-28 11:57:48,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.86/10.66 [2019-03-28 11:57:48,521 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 20.86/10.66 [2019-03-28 11:57:48,524 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.86/10.66 [2019-03-28 11:57:48,524 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.86/10.66 [2019-03-28 11:57:48,525 INFO L518 LassoAnalysis]: Proved termination. 20.86/10.66 [2019-03-28 11:57:48,525 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.86/10.66 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 20.86/10.66 Supporting invariants [] 20.86/10.66 [2019-03-28 11:57:48,527 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.86/10.66 [2019-03-28 11:57:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:48,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:48,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:48,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:48,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.86/10.66 [2019-03-28 11:57:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:48,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:48,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:48,681 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 20.86/10.66 [2019-03-28 11:57:48,686 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 20.86/10.66 [2019-03-28 11:57:48,688 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states. Second operand 4 states. 20.86/10.66 [2019-03-28 11:57:48,793 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states.. Second operand 4 states. Result 26 states and 44 transitions. Complement of second has 10 states. 20.86/10.66 [2019-03-28 11:57:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 20.86/10.66 [2019-03-28 11:57:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.86/10.66 [2019-03-28 11:57:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. 20.86/10.66 [2019-03-28 11:57:48,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 1 letters. Loop has 4 letters. 20.86/10.66 [2019-03-28 11:57:48,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:48,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 5 letters. Loop has 4 letters. 20.86/10.66 [2019-03-28 11:57:48,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:48,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 1 letters. Loop has 8 letters. 20.86/10.66 [2019-03-28 11:57:48,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:48,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 44 transitions. 20.86/10.66 [2019-03-28 11:57:48,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.86/10.66 [2019-03-28 11:57:48,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 26 transitions. 20.86/10.66 [2019-03-28 11:57:48,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 20.86/10.66 [2019-03-28 11:57:48,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 20.86/10.66 [2019-03-28 11:57:48,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. 20.86/10.66 [2019-03-28 11:57:48,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.86/10.66 [2019-03-28 11:57:48,817 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. 20.86/10.66 [2019-03-28 11:57:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. 20.86/10.66 [2019-03-28 11:57:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. 20.86/10.66 [2019-03-28 11:57:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 20.86/10.66 [2019-03-28 11:57:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. 20.86/10.66 [2019-03-28 11:57:48,847 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. 20.86/10.66 [2019-03-28 11:57:48,847 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. 20.86/10.66 [2019-03-28 11:57:48,847 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.86/10.66 [2019-03-28 11:57:48,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 22 transitions. 20.86/10.66 [2019-03-28 11:57:48,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.86/10.66 [2019-03-28 11:57:48,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.86/10.66 [2019-03-28 11:57:48,848 INFO L119 BuchiIsEmpty]: Starting construction of run 20.86/10.66 [2019-03-28 11:57:48,849 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.86/10.66 [2019-03-28 11:57:48,849 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:48,849 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 100#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 101#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 102#L30 20.86/10.66 [2019-03-28 11:57:48,850 INFO L796 eck$LassoCheckResult]: Loop: 102#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 105#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 95#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 107#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 102#L30 20.86/10.66 [2019-03-28 11:57:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash 66906, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:48,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:48,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:48,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2542442, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:48,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:48,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:48,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1661172803, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:48,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:48,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:48,909 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:48,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:48,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:48,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:48,910 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.86/10.66 [2019-03-28 11:57:48,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:48,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:48,910 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:48,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.86/10.66 [2019-03-28 11:57:48,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:48,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:48,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:48,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:48,977 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:48,977 INFO L412 LassoAnalysis]: Checking for nontermination... 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:48,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:48,981 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:49,015 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 [2019-03-28 11:57:49,195 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.86/10.66 [2019-03-28 11:57:49,198 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:49,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:49,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:49,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:49,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.86/10.66 [2019-03-28 11:57:49,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:49,200 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:49,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.86/10.66 [2019-03-28 11:57:49,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:49,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:49,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:49,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:49,271 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:49,271 INFO L497 LassoAnalysis]: Using template 'affine'. 20.86/10.66 [2019-03-28 11:57:49,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.66 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.66 Number of strict supporting invariants: 0 20.86/10.66 Number of non-strict supporting invariants: 1 20.86/10.66 Consider only non-deceasing supporting invariants: true 20.86/10.66 Simplify termination arguments: true 20.86/10.66 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.66 [2019-03-28 11:57:49,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.66 [2019-03-28 11:57:49,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.66 [2019-03-28 11:57:49,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.66 [2019-03-28 11:57:49,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.66 [2019-03-28 11:57:49,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.66 [2019-03-28 11:57:49,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.66 [2019-03-28 11:57:49,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.66 [2019-03-28 11:57:49,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.86/10.66 [2019-03-28 11:57:49,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.86/10.66 [2019-03-28 11:57:49,293 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 20.86/10.66 [2019-03-28 11:57:49,294 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.86/10.66 [2019-03-28 11:57:49,294 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.86/10.66 [2019-03-28 11:57:49,294 INFO L518 LassoAnalysis]: Proved termination. 20.86/10.66 [2019-03-28 11:57:49,294 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.86/10.66 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.86/10.66 Supporting invariants [] 20.86/10.66 [2019-03-28 11:57:49,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.86/10.66 [2019-03-28 11:57:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:49,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:49,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:49,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:49,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.86/10.66 [2019-03-28 11:57:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:49,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:49,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:49,355 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.86/10.66 [2019-03-28 11:57:49,356 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.86/10.66 [2019-03-28 11:57:49,356 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 22 transitions. cyclomatic complexity: 10 Second operand 4 states. 20.86/10.66 [2019-03-28 11:57:49,447 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 22 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 32 states and 53 transitions. Complement of second has 17 states. 20.86/10.66 [2019-03-28 11:57:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 20.86/10.66 [2019-03-28 11:57:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.86/10.66 [2019-03-28 11:57:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. 20.86/10.66 [2019-03-28 11:57:49,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. 20.86/10.66 [2019-03-28 11:57:49,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:49,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. 20.86/10.66 [2019-03-28 11:57:49,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:49,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 8 letters. 20.86/10.66 [2019-03-28 11:57:49,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:49,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 53 transitions. 20.86/10.66 [2019-03-28 11:57:49,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 20.86/10.66 [2019-03-28 11:57:49,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 38 transitions. 20.86/10.66 [2019-03-28 11:57:49,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 20.86/10.66 [2019-03-28 11:57:49,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 20.86/10.66 [2019-03-28 11:57:49,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 38 transitions. 20.86/10.66 [2019-03-28 11:57:49,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.86/10.66 [2019-03-28 11:57:49,458 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. 20.86/10.66 [2019-03-28 11:57:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 38 transitions. 20.86/10.66 [2019-03-28 11:57:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 20.86/10.66 [2019-03-28 11:57:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 20.86/10.66 [2019-03-28 11:57:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. 20.86/10.66 [2019-03-28 11:57:49,462 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. 20.86/10.66 [2019-03-28 11:57:49,463 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. 20.86/10.66 [2019-03-28 11:57:49,463 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.86/10.66 [2019-03-28 11:57:49,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 35 transitions. 20.86/10.66 [2019-03-28 11:57:49,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 20.86/10.66 [2019-03-28 11:57:49,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.86/10.66 [2019-03-28 11:57:49,464 INFO L119 BuchiIsEmpty]: Starting construction of run 20.86/10.66 [2019-03-28 11:57:49,465 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.86/10.66 [2019-03-28 11:57:49,465 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:49,465 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 217#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 227#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 225#L30 20.86/10.66 [2019-03-28 11:57:49,465 INFO L796 eck$LassoCheckResult]: Loop: 225#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 222#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 223#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 228#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 219#L23 [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 211#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 212#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 232#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 225#L30 20.86/10.66 [2019-03-28 11:57:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash 66906, now seen corresponding path program 2 times 20.86/10.66 [2019-03-28 11:57:49,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:49,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1331247487, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:49,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:49,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 27091674, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:49,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:49,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:49,560 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:49,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:49,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:49,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:49,560 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.86/10.66 [2019-03-28 11:57:49,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:49,561 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:49,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 20.86/10.66 [2019-03-28 11:57:49,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:49,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:49,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:49,614 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:49,614 INFO L412 LassoAnalysis]: Checking for nontermination... 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:49,619 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 [2019-03-28 11:57:49,647 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.86/10.66 [2019-03-28 11:57:49,647 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:49,652 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:49,687 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 [2019-03-28 11:57:49,843 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.86/10.66 [2019-03-28 11:57:49,846 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:49,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:49,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:49,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:49,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.86/10.66 [2019-03-28 11:57:49,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:49,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:49,847 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:49,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 20.86/10.66 [2019-03-28 11:57:49,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:49,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:49,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:49,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:49,914 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:49,914 INFO L497 LassoAnalysis]: Using template 'affine'. 20.86/10.66 [2019-03-28 11:57:49,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.66 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.66 Number of strict supporting invariants: 0 20.86/10.66 Number of non-strict supporting invariants: 1 20.86/10.66 Consider only non-deceasing supporting invariants: true 20.86/10.66 Simplify termination arguments: true 20.86/10.66 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.66 [2019-03-28 11:57:49,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.66 [2019-03-28 11:57:49,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.66 [2019-03-28 11:57:49,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.66 [2019-03-28 11:57:49,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.66 [2019-03-28 11:57:49,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.66 [2019-03-28 11:57:49,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.66 [2019-03-28 11:57:49,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.66 [2019-03-28 11:57:49,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.86/10.66 [2019-03-28 11:57:49,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.66 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.66 Number of strict supporting invariants: 0 20.86/10.66 Number of non-strict supporting invariants: 1 20.86/10.66 Consider only non-deceasing supporting invariants: true 20.86/10.66 Simplify termination arguments: true 20.86/10.66 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.66 [2019-03-28 11:57:49,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.66 [2019-03-28 11:57:49,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.66 [2019-03-28 11:57:49,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.66 [2019-03-28 11:57:49,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.66 [2019-03-28 11:57:49,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.66 [2019-03-28 11:57:49,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.66 [2019-03-28 11:57:49,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.66 [2019-03-28 11:57:49,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.86/10.66 [2019-03-28 11:57:49,935 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.86/10.66 [2019-03-28 11:57:49,936 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 20.86/10.66 [2019-03-28 11:57:49,936 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.86/10.66 [2019-03-28 11:57:49,936 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.86/10.66 [2019-03-28 11:57:49,936 INFO L518 LassoAnalysis]: Proved termination. 20.86/10.66 [2019-03-28 11:57:49,936 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.86/10.66 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 20.86/10.66 Supporting invariants [] 20.86/10.66 [2019-03-28 11:57:49,937 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.86/10.66 [2019-03-28 11:57:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:49,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:49,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:49,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:49,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.86/10.66 [2019-03-28 11:57:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,007 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.66 [2019-03-28 11:57:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,014 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.66 [2019-03-28 11:57:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,057 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 20.86/10.66 [2019-03-28 11:57:50,058 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 20.86/10.66 [2019-03-28 11:57:50,059 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 35 transitions. cyclomatic complexity: 15 Second operand 5 states. 20.86/10.66 [2019-03-28 11:57:50,323 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 35 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 61 states and 95 transitions. Complement of second has 28 states. 20.86/10.66 [2019-03-28 11:57:50,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 3 accepting loop states 20.86/10.66 [2019-03-28 11:57:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.86/10.66 [2019-03-28 11:57:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. 20.86/10.66 [2019-03-28 11:57:50,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 8 letters. 20.86/10.66 [2019-03-28 11:57:50,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:50,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. 20.86/10.66 [2019-03-28 11:57:50,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:50,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 16 letters. 20.86/10.66 [2019-03-28 11:57:50,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:50,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 95 transitions. 20.86/10.66 [2019-03-28 11:57:50,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 20.86/10.66 [2019-03-28 11:57:50,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 37 states and 57 transitions. 20.86/10.66 [2019-03-28 11:57:50,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 20.86/10.66 [2019-03-28 11:57:50,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 20.86/10.66 [2019-03-28 11:57:50,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. 20.86/10.66 [2019-03-28 11:57:50,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.86/10.66 [2019-03-28 11:57:50,334 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. 20.86/10.66 [2019-03-28 11:57:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. 20.86/10.66 [2019-03-28 11:57:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. 20.86/10.66 [2019-03-28 11:57:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 20.86/10.66 [2019-03-28 11:57:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. 20.86/10.66 [2019-03-28 11:57:50,338 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 49 transitions. 20.86/10.66 [2019-03-28 11:57:50,338 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 49 transitions. 20.86/10.66 [2019-03-28 11:57:50,338 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.86/10.66 [2019-03-28 11:57:50,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 49 transitions. 20.86/10.66 [2019-03-28 11:57:50,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 20.86/10.66 [2019-03-28 11:57:50,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.86/10.66 [2019-03-28 11:57:50,339 INFO L119 BuchiIsEmpty]: Starting construction of run 20.86/10.66 [2019-03-28 11:57:50,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:50,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:50,341 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 442#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 456#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 451#L30 [45] L30-->L30-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_10 v_ULTIMATE.start_main_~y~0_10) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 447#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 448#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 466#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 446#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 464#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 458#L22-2 20.86/10.66 [2019-03-28 11:57:50,341 INFO L796 eck$LassoCheckResult]: Loop: 458#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 443#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 444#L23 [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 439#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 440#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 469#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 452#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 447#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 448#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 466#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 446#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 464#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 458#L22-2 20.86/10.66 [2019-03-28 11:57:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1569801954, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:50,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1073913814, now seen corresponding path program 2 times 20.86/10.66 [2019-03-28 11:57:50,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash -503949881, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:50,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:50,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,467 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:50,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:50,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:50,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:50,467 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.86/10.66 [2019-03-28 11:57:50,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:50,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:50,468 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:50,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 20.86/10.66 [2019-03-28 11:57:50,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:50,468 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:50,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:50,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:50,508 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:50,508 INFO L412 LassoAnalysis]: Checking for nontermination... 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:50,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:50,511 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.66 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.66 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:50,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.86/10.66 [2019-03-28 11:57:50,546 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.66 [2019-03-28 11:57:50,595 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.86/10.66 [2019-03-28 11:57:50,597 INFO L216 LassoAnalysis]: Preferences: 20.86/10.66 [2019-03-28 11:57:50,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.66 [2019-03-28 11:57:50,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.66 [2019-03-28 11:57:50,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.66 [2019-03-28 11:57:50,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.86/10.66 [2019-03-28 11:57:50,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.86/10.66 [2019-03-28 11:57:50,598 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.66 [2019-03-28 11:57:50,598 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.66 [2019-03-28 11:57:50,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 20.86/10.66 [2019-03-28 11:57:50,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.66 [2019-03-28 11:57:50,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.66 [2019-03-28 11:57:50,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:50,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.66 [2019-03-28 11:57:50,640 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.66 [2019-03-28 11:57:50,640 INFO L497 LassoAnalysis]: Using template 'affine'. 20.86/10.66 [2019-03-28 11:57:50,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.66 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.66 Number of strict supporting invariants: 0 20.86/10.66 Number of non-strict supporting invariants: 1 20.86/10.66 Consider only non-deceasing supporting invariants: true 20.86/10.66 Simplify termination arguments: true 20.86/10.66 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.66 [2019-03-28 11:57:50,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.66 [2019-03-28 11:57:50,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.66 [2019-03-28 11:57:50,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.66 [2019-03-28 11:57:50,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.66 [2019-03-28 11:57:50,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.66 [2019-03-28 11:57:50,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.66 [2019-03-28 11:57:50,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.66 [2019-03-28 11:57:50,649 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.86/10.66 [2019-03-28 11:57:50,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.86/10.66 [2019-03-28 11:57:50,654 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 20.86/10.66 [2019-03-28 11:57:50,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.86/10.66 [2019-03-28 11:57:50,655 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.86/10.66 [2019-03-28 11:57:50,655 INFO L518 LassoAnalysis]: Proved termination. 20.86/10.66 [2019-03-28 11:57:50,655 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.86/10.66 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.86/10.66 Supporting invariants [] 20.86/10.66 [2019-03-28 11:57:50,655 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.86/10.66 [2019-03-28 11:57:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.86/10.66 [2019-03-28 11:57:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,775 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.66 [2019-03-28 11:57:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,785 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.66 [2019-03-28 11:57:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:50,796 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.66 [2019-03-28 11:57:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.66 [2019-03-28 11:57:50,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core 20.86/10.66 [2019-03-28 11:57:50,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.66 [2019-03-28 11:57:50,877 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization 20.86/10.66 [2019-03-28 11:57:50,877 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 9 loop predicates 20.86/10.66 [2019-03-28 11:57:50,877 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 49 transitions. cyclomatic complexity: 20 Second operand 7 states. 20.86/10.66 [2019-03-28 11:57:51,182 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 49 transitions. cyclomatic complexity: 20. Second operand 7 states. Result 110 states and 174 transitions. Complement of second has 24 states. 20.86/10.66 [2019-03-28 11:57:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 10 non-accepting loop states 3 accepting loop states 20.86/10.66 [2019-03-28 11:57:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 20.86/10.66 [2019-03-28 11:57:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. 20.86/10.66 [2019-03-28 11:57:51,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 12 letters. 20.86/10.66 [2019-03-28 11:57:51,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:51,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 21 letters. Loop has 12 letters. 20.86/10.66 [2019-03-28 11:57:51,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:51,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 24 letters. 20.86/10.66 [2019-03-28 11:57:51,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.66 [2019-03-28 11:57:51,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 174 transitions. 20.86/10.66 [2019-03-28 11:57:51,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 20.86/10.66 [2019-03-28 11:57:51,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 78 states and 122 transitions. 20.86/10.66 [2019-03-28 11:57:51,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 20.86/10.66 [2019-03-28 11:57:51,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 20.86/10.66 [2019-03-28 11:57:51,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 122 transitions. 20.86/10.66 [2019-03-28 11:57:51,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.86/10.66 [2019-03-28 11:57:51,193 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 122 transitions. 20.86/10.66 [2019-03-28 11:57:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 122 transitions. 20.86/10.66 [2019-03-28 11:57:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. 20.86/10.66 [2019-03-28 11:57:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 20.86/10.66 [2019-03-28 11:57:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. 20.86/10.66 [2019-03-28 11:57:51,198 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. 20.86/10.66 [2019-03-28 11:57:51,198 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. 20.86/10.66 [2019-03-28 11:57:51,198 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.86/10.66 [2019-03-28 11:57:51,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 69 transitions. 20.86/10.66 [2019-03-28 11:57:51,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 20.86/10.66 [2019-03-28 11:57:51,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.86/10.66 [2019-03-28 11:57:51,199 INFO L119 BuchiIsEmpty]: Starting construction of run 20.86/10.66 [2019-03-28 11:57:51,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] 20.86/10.66 [2019-03-28 11:57:51,200 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 2, 1, 1] 20.86/10.66 [2019-03-28 11:57:51,200 INFO L794 eck$LassoCheckResult]: Stem: 820#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 821#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 822#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 823#L30 [45] L30-->L30-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_10 v_ULTIMATE.start_main_~y~0_10) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 830#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 846#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 847#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 841#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 835#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 832#L22-2 20.86/10.66 [2019-03-28 11:57:51,201 INFO L796 eck$LassoCheckResult]: Loop: 832#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 833#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 853#L23 [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 818#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 819#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 860#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 852#L23 [41] L23-->L23-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_6 v_ULTIMATE.start_main_~y~0_7) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~x~0_6 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 829#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 850#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 849#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 848#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 830#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 846#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 847#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 841#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 835#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 832#L22-2 20.86/10.66 [2019-03-28 11:57:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1569801954, now seen corresponding path program 2 times 20.86/10.66 [2019-03-28 11:57:51,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -480186452, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:51,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:51,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.66 [2019-03-28 11:57:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.66 [2019-03-28 11:57:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash -830746935, now seen corresponding path program 1 times 20.86/10.66 [2019-03-28 11:57:51,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.86/10.66 [2019-03-28 11:57:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.86/10.66 [2019-03-28 11:57:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.86/10.66 [2019-03-28 11:57:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.86/10.67 [2019-03-28 11:57:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,359 INFO L216 LassoAnalysis]: Preferences: 20.86/10.67 [2019-03-28 11:57:51,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.67 [2019-03-28 11:57:51,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.67 [2019-03-28 11:57:51,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.67 [2019-03-28 11:57:51,359 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.86/10.67 [2019-03-28 11:57:51,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.67 [2019-03-28 11:57:51,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.67 [2019-03-28 11:57:51,360 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.67 [2019-03-28 11:57:51,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.86/10.67 [2019-03-28 11:57:51,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.67 [2019-03-28 11:57:51,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.67 [2019-03-28 11:57:51,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.67 [2019-03-28 11:57:51,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.67 [2019-03-28 11:57:51,399 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.67 [2019-03-28 11:57:51,399 INFO L412 LassoAnalysis]: Checking for nontermination... 20.86/10.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.67 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.67 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.67 [2019-03-28 11:57:51,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.67 [2019-03-28 11:57:51,402 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.67 [2019-03-28 11:57:51,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.86/10.67 [2019-03-28 11:57:51,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.86/10.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.67 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.67 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.67 [2019-03-28 11:57:51,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.86/10.67 [2019-03-28 11:57:51,434 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.86/10.67 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.86/10.67 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.86/10.67 [2019-03-28 11:57:51,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.86/10.67 [2019-03-28 11:57:51,469 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.86/10.67 [2019-03-28 11:57:51,542 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.86/10.67 [2019-03-28 11:57:51,544 INFO L216 LassoAnalysis]: Preferences: 20.86/10.67 [2019-03-28 11:57:51,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.86/10.67 [2019-03-28 11:57:51,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.86/10.67 [2019-03-28 11:57:51,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.86/10.67 [2019-03-28 11:57:51,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.86/10.67 [2019-03-28 11:57:51,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.86/10.67 [2019-03-28 11:57:51,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.86/10.67 [2019-03-28 11:57:51,545 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.86/10.67 [2019-03-28 11:57:51,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.86/10.67 [2019-03-28 11:57:51,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.86/10.67 [2019-03-28 11:57:51,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.86/10.67 [2019-03-28 11:57:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.67 [2019-03-28 11:57:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.86/10.67 [2019-03-28 11:57:51,583 INFO L300 LassoAnalysis]: Preprocessing complete. 20.86/10.67 [2019-03-28 11:57:51,584 INFO L497 LassoAnalysis]: Using template 'affine'. 20.86/10.67 [2019-03-28 11:57:51,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.67 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.67 Number of strict supporting invariants: 0 20.86/10.67 Number of non-strict supporting invariants: 1 20.86/10.67 Consider only non-deceasing supporting invariants: true 20.86/10.67 Simplify termination arguments: true 20.86/10.67 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.67 [2019-03-28 11:57:51,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.67 [2019-03-28 11:57:51,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.67 [2019-03-28 11:57:51,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.67 [2019-03-28 11:57:51,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.67 [2019-03-28 11:57:51,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.67 [2019-03-28 11:57:51,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.67 [2019-03-28 11:57:51,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.67 [2019-03-28 11:57:51,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.86/10.67 [2019-03-28 11:57:51,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.86/10.67 Termination analysis: LINEAR_WITH_GUESSES 20.86/10.67 Number of strict supporting invariants: 0 20.86/10.67 Number of non-strict supporting invariants: 1 20.86/10.67 Consider only non-deceasing supporting invariants: true 20.86/10.67 Simplify termination arguments: true 20.86/10.67 Simplify supporting invariants: trueOverapproximate stem: false 20.86/10.67 [2019-03-28 11:57:51,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.86/10.67 [2019-03-28 11:57:51,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.86/10.67 [2019-03-28 11:57:51,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.86/10.67 [2019-03-28 11:57:51,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.86/10.67 [2019-03-28 11:57:51,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.86/10.67 [2019-03-28 11:57:51,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.86/10.67 [2019-03-28 11:57:51,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.86/10.67 [2019-03-28 11:57:51,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.86/10.67 [2019-03-28 11:57:51,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.86/10.67 [2019-03-28 11:57:51,598 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 20.86/10.67 [2019-03-28 11:57:51,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.86/10.67 [2019-03-28 11:57:51,599 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.86/10.67 [2019-03-28 11:57:51,599 INFO L518 LassoAnalysis]: Proved termination. 20.86/10.67 [2019-03-28 11:57:51,599 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.86/10.67 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.86/10.67 Supporting invariants [] 20.86/10.67 [2019-03-28 11:57:51,599 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.86/10.67 [2019-03-28 11:57:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.67 [2019-03-28 11:57:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:51,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:51,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:51,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:51,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.86/10.67 [2019-03-28 11:57:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,712 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.67 [2019-03-28 11:57:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,720 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.67 [2019-03-28 11:57:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,728 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.67 [2019-03-28 11:57:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,737 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.67 [2019-03-28 11:57:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,746 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.67 [2019-03-28 11:57:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.86/10.67 [2019-03-28 11:57:51,756 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 20.86/10.67 [2019-03-28 11:57:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:51,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:51,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:51,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:51,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:51,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:51,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:51,867 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 11 predicates after loop cannibalization 20.86/10.67 [2019-03-28 11:57:51,867 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 11 loop predicates 20.86/10.67 [2019-03-28 11:57:51,867 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28 Second operand 8 states. 20.86/10.67 [2019-03-28 11:57:52,412 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28. Second operand 8 states. Result 152 states and 229 transitions. Complement of second has 36 states. 20.86/10.67 [2019-03-28 11:57:52,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 16 non-accepting loop states 3 accepting loop states 20.86/10.67 [2019-03-28 11:57:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.86/10.67 [2019-03-28 11:57:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. 20.86/10.67 [2019-03-28 11:57:52,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 60 transitions. Stem has 9 letters. Loop has 16 letters. 20.86/10.67 [2019-03-28 11:57:52,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.67 [2019-03-28 11:57:52,415 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 20.86/10.67 [2019-03-28 11:57:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.86/10.67 [2019-03-28 11:57:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:52,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:52,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.86/10.67 [2019-03-28 11:57:52,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 20.86/10.67 [2019-03-28 11:57:52,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.86/10.67 [2019-03-28 11:57:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.86/10.67 [2019-03-28 11:57:52,491 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates 20.86/10.67 [2019-03-28 11:57:52,492 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28 Second operand 8 states. 20.86/10.67 [2019-03-28 11:57:52,723 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28. Second operand 8 states. Result 233 states and 361 transitions. Complement of second has 51 states. 20.86/10.67 [2019-03-28 11:57:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states 20.86/10.67 [2019-03-28 11:57:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.86/10.67 [2019-03-28 11:57:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. 20.86/10.67 [2019-03-28 11:57:52,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 16 letters. 20.86/10.67 [2019-03-28 11:57:52,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.67 [2019-03-28 11:57:52,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 25 letters. Loop has 16 letters. 20.86/10.67 [2019-03-28 11:57:52,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.67 [2019-03-28 11:57:52,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 32 letters. 20.86/10.67 [2019-03-28 11:57:52,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.86/10.67 [2019-03-28 11:57:52,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 361 transitions. 20.86/10.67 [2019-03-28 11:57:52,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.86/10.67 [2019-03-28 11:57:52,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 0 states and 0 transitions. 20.86/10.67 [2019-03-28 11:57:52,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.86/10.67 [2019-03-28 11:57:52,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.86/10.67 [2019-03-28 11:57:52,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.86/10.67 [2019-03-28 11:57:52,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.86/10.67 [2019-03-28 11:57:52,736 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.86/10.67 [2019-03-28 11:57:52,736 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.86/10.67 [2019-03-28 11:57:52,736 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.86/10.67 [2019-03-28 11:57:52,736 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.86/10.67 [2019-03-28 11:57:52,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.86/10.67 [2019-03-28 11:57:52,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.86/10.67 [2019-03-28 11:57:52,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.86/10.67 [2019-03-28 11:57:52,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:57:52 BasicIcfg 20.86/10.67 [2019-03-28 11:57:52,742 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.86/10.67 [2019-03-28 11:57:52,743 INFO L168 Benchmark]: Toolchain (without parser) took 5568.87 ms. Allocated memory was 649.6 MB in the beginning and 766.5 MB in the end (delta: 116.9 MB). Free memory was 558.5 MB in the beginning and 614.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 60.7 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,745 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.86 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 548.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.94 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 548.9 MB in the beginning and 645.6 MB in the end (delta: -96.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,746 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 ms. Allocated memory is still 677.9 MB. Free memory was 645.6 MB in the beginning and 642.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,747 INFO L168 Benchmark]: RCFGBuilder took 197.53 ms. Allocated memory is still 677.9 MB. Free memory was 642.5 MB in the beginning and 627.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,747 INFO L168 Benchmark]: BlockEncodingV2 took 75.66 ms. Allocated memory is still 677.9 MB. Free memory was 627.6 MB in the beginning and 622.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,748 INFO L168 Benchmark]: TraceAbstraction took 156.84 ms. Allocated memory is still 677.9 MB. Free memory was 622.2 MB in the beginning and 612.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,749 INFO L168 Benchmark]: BuchiAutomizer took 4783.13 ms. Allocated memory was 677.9 MB in the beginning and 766.5 MB in the end (delta: 88.6 MB). Free memory was 612.7 MB in the beginning and 614.7 MB in the end (delta: -1.9 MB). Peak memory consumption was 86.7 MB. Max. memory is 50.3 GB. 20.86/10.67 [2019-03-28 11:57:52,753 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.86/10.67 --- Results --- 20.86/10.67 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.86/10.67 - StatisticsResult: Initial Icfg 20.86/10.67 10 locations, 14 edges 20.86/10.67 - StatisticsResult: Encoded RCFG 20.86/10.67 7 locations, 11 edges 20.86/10.67 * Results from de.uni_freiburg.informatik.ultimate.core: 20.86/10.67 - StatisticsResult: Toolchain Benchmarks 20.86/10.67 Benchmark results are: 20.86/10.67 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.86/10.67 * CACSL2BoogieTranslator took 235.86 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 548.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 20.86/10.67 * Boogie Procedure Inliner took 93.94 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 548.9 MB in the beginning and 645.6 MB in the end (delta: -96.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. 20.86/10.67 * Boogie Preprocessor took 20.52 ms. Allocated memory is still 677.9 MB. Free memory was 645.6 MB in the beginning and 642.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.86/10.67 * RCFGBuilder took 197.53 ms. Allocated memory is still 677.9 MB. Free memory was 642.5 MB in the beginning and 627.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 50.3 GB. 20.86/10.67 * BlockEncodingV2 took 75.66 ms. Allocated memory is still 677.9 MB. Free memory was 627.6 MB in the beginning and 622.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.86/10.67 * TraceAbstraction took 156.84 ms. Allocated memory is still 677.9 MB. Free memory was 622.2 MB in the beginning and 612.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.86/10.67 * BuchiAutomizer took 4783.13 ms. Allocated memory was 677.9 MB in the beginning and 766.5 MB in the end (delta: 88.6 MB). Free memory was 612.7 MB in the beginning and 614.7 MB in the end (delta: -1.9 MB). Peak memory consumption was 86.7 MB. Max. memory is 50.3 GB. 20.86/10.67 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.86/10.67 - AllSpecificationsHoldResult: All specifications hold 20.86/10.67 We were not able to verify any specifiation because the program does not contain any specification. 20.86/10.67 - InvariantResult [Line: 21]: Loop Invariant 20.86/10.67 Derived loop invariant: 1 20.86/10.67 - StatisticsResult: Ultimate Automizer benchmark data 20.86/10.67 CFG has 1 procedures, 7 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=7occurred 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 20.86/10.67 - StatisticsResult: Constructed decomposition of program 20.86/10.67 Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 11 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. One nondeterministic module has affine ranking function x and consists of 13 locations. 20.86/10.67 - StatisticsResult: Timing statistics 20.86/10.67 BüchiAutomizer plugin needed 4.7s and 6 iterations. TraceHistogramMax:4. 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 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 4. Nontrivial modules had stage [4, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/26 HoareTripleCheckerStatistics: 87 SDtfs, 245 SDslu, 233 SDs, 0 SdLazy, 551 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq141 hnf94 smp100 dnf100 smp100 tf107 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 20.86/10.67 - TerminationAnalysisResult: Termination proven 20.86/10.67 Buchi Automizer proved that your program is terminating 20.86/10.67 RESULT: Ultimate proved your program to be correct! 20.86/10.67 !SESSION 2019-03-28 11:57:43.277 ----------------------------------------------- 20.86/10.67 eclipse.buildId=unknown 20.86/10.67 java.version=1.8.0_181 20.86/10.67 java.vendor=Oracle Corporation 20.86/10.67 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.86/10.67 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.86/10.67 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.86/10.67 20.86/10.67 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:57:52.985 20.86/10.67 !MESSAGE The workspace will exit with unsaved changes in this session. 20.86/10.67 Received shutdown request... 20.86/10.67 Ultimate: 20.86/10.67 GTK+ Version Check 20.86/10.67 EOF