17.32/8.02 NO 17.32/8.02 17.32/8.02 Ultimate: Cannot open display: 17.32/8.02 This is Ultimate 0.1.24-8dc7c08-m 17.32/8.02 [2019-03-29 01:42:15,458 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.32/8.02 [2019-03-29 01:42:15,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.32/8.02 [2019-03-29 01:42:15,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.32/8.02 [2019-03-29 01:42:15,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.32/8.02 [2019-03-29 01:42:15,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.32/8.02 [2019-03-29 01:42:15,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.32/8.02 [2019-03-29 01:42:15,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.32/8.02 [2019-03-29 01:42:15,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.32/8.02 [2019-03-29 01:42:15,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.32/8.02 [2019-03-29 01:42:15,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.32/8.02 [2019-03-29 01:42:15,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.32/8.02 [2019-03-29 01:42:15,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.32/8.02 [2019-03-29 01:42:15,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.32/8.02 [2019-03-29 01:42:15,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.32/8.02 [2019-03-29 01:42:15,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.32/8.02 [2019-03-29 01:42:15,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.32/8.02 [2019-03-29 01:42:15,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.32/8.02 [2019-03-29 01:42:15,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.32/8.02 [2019-03-29 01:42:15,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.32/8.02 [2019-03-29 01:42:15,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.32/8.02 [2019-03-29 01:42:15,493 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.32/8.02 [2019-03-29 01:42:15,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.32/8.02 [2019-03-29 01:42:15,494 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.32/8.02 [2019-03-29 01:42:15,495 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.32/8.02 [2019-03-29 01:42:15,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.32/8.02 [2019-03-29 01:42:15,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.32/8.02 [2019-03-29 01:42:15,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.32/8.02 [2019-03-29 01:42:15,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.32/8.02 [2019-03-29 01:42:15,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.32/8.02 [2019-03-29 01:42:15,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.32/8.02 [2019-03-29 01:42:15,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.32/8.02 [2019-03-29 01:42:15,501 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 17.32/8.02 [2019-03-29 01:42:15,515 INFO L110 SettingsManager]: Loading preferences was successful 17.32/8.02 [2019-03-29 01:42:15,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.32/8.02 [2019-03-29 01:42:15,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.32/8.02 [2019-03-29 01:42:15,516 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.32/8.02 [2019-03-29 01:42:15,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.32/8.02 [2019-03-29 01:42:15,517 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.32/8.02 [2019-03-29 01:42:15,517 INFO L133 SettingsManager]: * Use SBE=true 17.32/8.02 [2019-03-29 01:42:15,517 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.32/8.02 [2019-03-29 01:42:15,517 INFO L133 SettingsManager]: * Use old map elimination=false 17.32/8.02 [2019-03-29 01:42:15,518 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.32/8.02 [2019-03-29 01:42:15,518 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.32/8.02 [2019-03-29 01:42:15,518 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.32/8.02 [2019-03-29 01:42:15,518 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.32/8.02 [2019-03-29 01:42:15,518 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.32/8.02 [2019-03-29 01:42:15,518 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:15,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.32/8.02 [2019-03-29 01:42:15,519 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.32/8.02 [2019-03-29 01:42:15,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.32/8.02 [2019-03-29 01:42:15,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.32/8.02 [2019-03-29 01:42:15,519 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.32/8.02 [2019-03-29 01:42:15,519 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.32/8.02 [2019-03-29 01:42:15,520 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.32/8.02 [2019-03-29 01:42:15,520 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.32/8.02 [2019-03-29 01:42:15,520 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.32/8.02 [2019-03-29 01:42:15,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.32/8.02 [2019-03-29 01:42:15,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.32/8.02 [2019-03-29 01:42:15,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.32/8.02 [2019-03-29 01:42:15,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.32/8.02 [2019-03-29 01:42:15,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.32/8.02 [2019-03-29 01:42:15,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.32/8.02 [2019-03-29 01:42:15,559 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.32/8.02 [2019-03-29 01:42:15,562 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.32/8.02 [2019-03-29 01:42:15,564 INFO L271 PluginConnector]: Initializing CDTParser... 17.32/8.02 [2019-03-29 01:42:15,564 INFO L276 PluginConnector]: CDTParser initialized 17.32/8.02 [2019-03-29 01:42:15,565 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 17.32/8.02 [2019-03-29 01:42:15,625 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c9305d4d3c214c26a4bf3c3e63b410bb/FLAGfa0758b7a 17.32/8.02 [2019-03-29 01:42:15,963 INFO L307 CDTParser]: Found 1 translation units. 17.32/8.02 [2019-03-29 01:42:15,964 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 17.32/8.02 [2019-03-29 01:42:15,971 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c9305d4d3c214c26a4bf3c3e63b410bb/FLAGfa0758b7a 17.32/8.02 [2019-03-29 01:42:16,389 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c9305d4d3c214c26a4bf3c3e63b410bb 17.32/8.02 [2019-03-29 01:42:16,400 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.32/8.02 [2019-03-29 01:42:16,402 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.32/8.02 [2019-03-29 01:42:16,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.32/8.02 [2019-03-29 01:42:16,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.32/8.02 [2019-03-29 01:42:16,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.32/8.02 [2019-03-29 01:42:16,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afbb762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:16,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.32/8.02 [2019-03-29 01:42:16,437 INFO L176 MainTranslator]: Built tables and reachable declarations 17.32/8.02 [2019-03-29 01:42:16,595 INFO L206 PostProcessor]: Analyzing one entry point: main 17.32/8.02 [2019-03-29 01:42:16,600 INFO L191 MainTranslator]: Completed pre-run 17.32/8.02 [2019-03-29 01:42:16,618 INFO L206 PostProcessor]: Analyzing one entry point: main 17.32/8.02 [2019-03-29 01:42:16,633 INFO L195 MainTranslator]: Completed translation 17.32/8.02 [2019-03-29 01:42:16,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16 WrapperNode 17.32/8.02 [2019-03-29 01:42:16,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.32/8.02 [2019-03-29 01:42:16,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.32/8.02 [2019-03-29 01:42:16,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.32/8.02 [2019-03-29 01:42:16,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.32/8.02 [2019-03-29 01:42:16,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.32/8.02 [2019-03-29 01:42:16,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.32/8.02 [2019-03-29 01:42:16,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.32/8.02 [2019-03-29 01:42:16,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.32/8.02 [2019-03-29 01:42:16,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:16,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.32/8.02 [2019-03-29 01:42:16,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.32/8.02 [2019-03-29 01:42:16,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.32/8.02 [2019-03-29 01:42:16,755 INFO L276 PluginConnector]: RCFGBuilder initialized 17.32/8.02 [2019-03-29 01:42:16,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (1/1) ... 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.32/8.02 [2019-03-29 01:42:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.32/8.02 [2019-03-29 01:42:16,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.32/8.02 [2019-03-29 01:42:16,980 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.32/8.02 [2019-03-29 01:42:16,980 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 17.32/8.02 [2019-03-29 01:42:16,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:42:16 BoogieIcfgContainer 17.32/8.02 [2019-03-29 01:42:16,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.32/8.02 [2019-03-29 01:42:16,983 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.32/8.02 [2019-03-29 01:42:16,983 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.32/8.02 [2019-03-29 01:42:16,985 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.32/8.02 [2019-03-29 01:42:16,986 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:42:16" (1/1) ... 17.32/8.02 [2019-03-29 01:42:17,002 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 12 edges 17.32/8.02 [2019-03-29 01:42:17,004 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.32/8.02 [2019-03-29 01:42:17,005 INFO L263 BlockEncoder]: Using Maximize final states 17.32/8.02 [2019-03-29 01:42:17,005 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.32/8.02 [2019-03-29 01:42:17,006 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.32/8.02 [2019-03-29 01:42:17,008 INFO L296 BlockEncoder]: Using Remove sink states 17.32/8.02 [2019-03-29 01:42:17,009 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.32/8.02 [2019-03-29 01:42:17,009 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.32/8.02 [2019-03-29 01:42:17,027 INFO L185 BlockEncoder]: Using Use SBE 17.32/8.02 [2019-03-29 01:42:17,043 INFO L200 BlockEncoder]: SBE split 1 edges 17.32/8.02 [2019-03-29 01:42:17,048 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.32/8.02 [2019-03-29 01:42:17,049 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.32/8.02 [2019-03-29 01:42:17,060 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 17.32/8.02 [2019-03-29 01:42:17,062 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 17.32/8.02 [2019-03-29 01:42:17,063 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.32/8.02 [2019-03-29 01:42:17,064 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.32/8.02 [2019-03-29 01:42:17,064 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.32/8.02 [2019-03-29 01:42:17,064 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.32/8.02 [2019-03-29 01:42:17,064 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 8 edges 17.32/8.02 [2019-03-29 01:42:17,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:42:17 BasicIcfg 17.32/8.02 [2019-03-29 01:42:17,065 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.32/8.02 [2019-03-29 01:42:17,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.32/8.02 [2019-03-29 01:42:17,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.32/8.02 [2019-03-29 01:42:17,070 INFO L276 PluginConnector]: TraceAbstraction initialized 17.32/8.02 [2019-03-29 01:42:17,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 01:42:16" (1/4) ... 17.32/8.02 [2019-03-29 01:42:17,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c359b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (2/4) ... 17.32/8.02 [2019-03-29 01:42:17,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c359b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:42:16" (3/4) ... 17.32/8.02 [2019-03-29 01:42:17,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c359b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:42:17" (4/4) ... 17.32/8.02 [2019-03-29 01:42:17,074 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.32/8.02 [2019-03-29 01:42:17,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.32/8.02 [2019-03-29 01:42:17,092 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 17.32/8.02 [2019-03-29 01:42:17,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 17.32/8.02 [2019-03-29 01:42:17,138 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.32/8.02 [2019-03-29 01:42:17,138 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.32/8.02 [2019-03-29 01:42:17,139 INFO L383 AbstractCegarLoop]: Hoare is true 17.32/8.02 [2019-03-29 01:42:17,139 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.32/8.02 [2019-03-29 01:42:17,139 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.32/8.02 [2019-03-29 01:42:17,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.32/8.02 [2019-03-29 01:42:17,139 INFO L387 AbstractCegarLoop]: Difference is false 17.32/8.02 [2019-03-29 01:42:17,140 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.32/8.02 [2019-03-29 01:42:17,140 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.32/8.02 [2019-03-29 01:42:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 17.32/8.02 [2019-03-29 01:42:17,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.32/8.02 [2019-03-29 01:42:17,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 17.32/8.02 [2019-03-29 01:42:17,214 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. 17.32/8.02 [2019-03-29 01:42:17,214 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 12 22) no Hoare annotation was computed. 17.32/8.02 [2019-03-29 01:42:17,214 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.32/8.02 [2019-03-29 01:42:17,214 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 22) no Hoare annotation was computed. 17.32/8.02 [2019-03-29 01:42:17,215 INFO L451 ceAbstractionStarter]: At program point L11-2(lines 11 24) the Hoare annotation is: true 17.32/8.02 [2019-03-29 01:42:17,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:42:17 BasicIcfg 17.32/8.02 [2019-03-29 01:42:17,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.32/8.02 [2019-03-29 01:42:17,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.32/8.02 [2019-03-29 01:42:17,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.32/8.02 [2019-03-29 01:42:17,227 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.32/8.02 [2019-03-29 01:42:17,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.32/8.02 [2019-03-29 01:42:17,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 01:42:16" (1/5) ... 17.32/8.02 [2019-03-29 01:42:17,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b641518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.32/8.02 [2019-03-29 01:42:17,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 01:42:16" (2/5) ... 17.32/8.02 [2019-03-29 01:42:17,230 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b641518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.32/8.02 [2019-03-29 01:42:17,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 01:42:16" (3/5) ... 17.32/8.02 [2019-03-29 01:42:17,230 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b641518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.32/8.02 [2019-03-29 01:42:17,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 01:42:17" (4/5) ... 17.32/8.02 [2019-03-29 01:42:17,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b641518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:42:17, skipping insertion in model container 17.32/8.02 [2019-03-29 01:42:17,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.32/8.02 [2019-03-29 01:42:17,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 01:42:17" (5/5) ... 17.32/8.02 [2019-03-29 01:42:17,233 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.32/8.02 [2019-03-29 01:42:17,261 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.32/8.02 [2019-03-29 01:42:17,262 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.32/8.02 [2019-03-29 01:42:17,262 INFO L375 BuchiCegarLoop]: Hoare is true 17.32/8.02 [2019-03-29 01:42:17,262 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.32/8.02 [2019-03-29 01:42:17,262 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.32/8.02 [2019-03-29 01:42:17,262 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.32/8.02 [2019-03-29 01:42:17,262 INFO L379 BuchiCegarLoop]: Difference is false 17.32/8.02 [2019-03-29 01:42:17,262 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.32/8.02 [2019-03-29 01:42:17,263 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.32/8.02 [2019-03-29 01:42:17,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 17.32/8.02 [2019-03-29 01:42:17,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.32/8.02 [2019-03-29 01:42:17,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:17,284 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:17,290 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.32/8.02 [2019-03-29 01:42:17,290 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.32/8.02 [2019-03-29 01:42:17,290 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.32/8.02 [2019-03-29 01:42:17,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 17.32/8.02 [2019-03-29 01:42:17,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.32/8.02 [2019-03-29 01:42:17,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:17,291 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:17,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.32/8.02 [2019-03-29 01:42:17,291 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.32/8.02 [2019-03-29 01:42:17,297 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 7#L11-2true 17.32/8.02 [2019-03-29 01:42:17,297 INFO L796 eck$LassoCheckResult]: Loop: 7#L11-2true [45] L11-2-->L12: Formula: (> 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 5#L12true [34] L12-->L16-2: Formula: (and (= 1 (+ v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~i~0_13)) (< (+ v_ULTIMATE.start_main_~w~0_10 v_ULTIMATE.start_main_~i~0_15) 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 6#L16-2true [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 7#L11-2true 17.32/8.02 [2019-03-29 01:42:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:17,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:17,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 74128, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:17,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1891379, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:17,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:17,451 INFO L216 LassoAnalysis]: Preferences: 17.32/8.02 [2019-03-29 01:42:17,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.32/8.02 [2019-03-29 01:42:17,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.32/8.02 [2019-03-29 01:42:17,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.32/8.02 [2019-03-29 01:42:17,453 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.32/8.02 [2019-03-29 01:42:17,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:17,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.32/8.02 [2019-03-29 01:42:17,453 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.32/8.02 [2019-03-29 01:42:17,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.32/8.02 [2019-03-29 01:42:17,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.32/8.02 [2019-03-29 01:42:17,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.32/8.02 [2019-03-29 01:42:17,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:17,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:17,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:17,595 INFO L300 LassoAnalysis]: Preprocessing complete. 17.32/8.02 [2019-03-29 01:42:17,596 INFO L412 LassoAnalysis]: Checking for nontermination... 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:17,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:17,621 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:17,654 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:17,654 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:17,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:17,660 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:17,687 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:17,688 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:17,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:17,693 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:17,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:17,724 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:17,757 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.32/8.02 [2019-03-29 01:42:17,759 INFO L216 LassoAnalysis]: Preferences: 17.32/8.02 [2019-03-29 01:42:17,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.32/8.02 [2019-03-29 01:42:17,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.32/8.02 [2019-03-29 01:42:17,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.32/8.02 [2019-03-29 01:42:17,760 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.32/8.02 [2019-03-29 01:42:17,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:17,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.32/8.02 [2019-03-29 01:42:17,760 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.32/8.02 [2019-03-29 01:42:17,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.32/8.02 [2019-03-29 01:42:17,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.32/8.02 [2019-03-29 01:42:17,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.32/8.02 [2019-03-29 01:42:17,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:17,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:17,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:17,860 INFO L300 LassoAnalysis]: Preprocessing complete. 17.32/8.02 [2019-03-29 01:42:17,865 INFO L497 LassoAnalysis]: Using template 'affine'. 17.32/8.02 [2019-03-29 01:42:17,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.32/8.02 Termination analysis: LINEAR_WITH_GUESSES 17.32/8.02 Number of strict supporting invariants: 0 17.32/8.02 Number of non-strict supporting invariants: 1 17.32/8.02 Consider only non-deceasing supporting invariants: true 17.32/8.02 Simplify termination arguments: true 17.32/8.02 Simplify supporting invariants: trueOverapproximate stem: false 17.32/8.02 [2019-03-29 01:42:17,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.32/8.02 [2019-03-29 01:42:17,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.32/8.02 [2019-03-29 01:42:17,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.32/8.02 [2019-03-29 01:42:17,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.32/8.02 [2019-03-29 01:42:17,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.32/8.02 [2019-03-29 01:42:17,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.32/8.02 [2019-03-29 01:42:17,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.32/8.02 [2019-03-29 01:42:17,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.32/8.02 Termination analysis: LINEAR_WITH_GUESSES 17.32/8.02 Number of strict supporting invariants: 0 17.32/8.02 Number of non-strict supporting invariants: 1 17.32/8.02 Consider only non-deceasing supporting invariants: true 17.32/8.02 Simplify termination arguments: true 17.32/8.02 Simplify supporting invariants: trueOverapproximate stem: false 17.32/8.02 [2019-03-29 01:42:17,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.32/8.02 [2019-03-29 01:42:17,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.32/8.02 [2019-03-29 01:42:17,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.32/8.02 [2019-03-29 01:42:17,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.32/8.02 [2019-03-29 01:42:17,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.32/8.02 [2019-03-29 01:42:17,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.32/8.02 [2019-03-29 01:42:17,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.32/8.02 [2019-03-29 01:42:17,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.32/8.02 Termination analysis: LINEAR_WITH_GUESSES 17.32/8.02 Number of strict supporting invariants: 0 17.32/8.02 Number of non-strict supporting invariants: 1 17.32/8.02 Consider only non-deceasing supporting invariants: true 17.32/8.02 Simplify termination arguments: true 17.32/8.02 Simplify supporting invariants: trueOverapproximate stem: false 17.32/8.02 [2019-03-29 01:42:17,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.32/8.02 [2019-03-29 01:42:17,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.32/8.02 [2019-03-29 01:42:17,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.32/8.02 [2019-03-29 01:42:17,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.32/8.02 [2019-03-29 01:42:17,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.32/8.02 [2019-03-29 01:42:17,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.32/8.02 [2019-03-29 01:42:17,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.32/8.02 [2019-03-29 01:42:17,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.32/8.02 [2019-03-29 01:42:17,922 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.32/8.02 [2019-03-29 01:42:17,922 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 17.32/8.02 [2019-03-29 01:42:17,925 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.32/8.02 [2019-03-29 01:42:17,925 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.32/8.02 [2019-03-29 01:42:17,925 INFO L518 LassoAnalysis]: Proved termination. 17.32/8.02 [2019-03-29 01:42:17,926 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.32/8.02 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 17.32/8.02 Supporting invariants [] 17.32/8.02 [2019-03-29 01:42:17,927 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.32/8.02 [2019-03-29 01:42:17,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:17,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 17.32/8.02 [2019-03-29 01:42:17,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.32/8.02 [2019-03-29 01:42:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:17,977 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.32/8.02 [2019-03-29 01:42:17,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.32/8.02 [2019-03-29 01:42:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:18,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.32/8.02 [2019-03-29 01:42:18,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.32/8.02 [2019-03-29 01:42:18,093 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 17.32/8.02 [2019-03-29 01:42:18,099 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 17.32/8.02 [2019-03-29 01:42:18,100 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. 17.32/8.02 [2019-03-29 01:42:18,278 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 46 states and 73 transitions. Complement of second has 14 states. 17.32/8.02 [2019-03-29 01:42:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states 17.32/8.02 [2019-03-29 01:42:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.32/8.02 [2019-03-29 01:42:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. 17.32/8.02 [2019-03-29 01:42:18,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 43 transitions. Stem has 1 letters. Loop has 3 letters. 17.32/8.02 [2019-03-29 01:42:18,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.32/8.02 [2019-03-29 01:42:18,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 43 transitions. Stem has 4 letters. Loop has 3 letters. 17.32/8.02 [2019-03-29 01:42:18,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.32/8.02 [2019-03-29 01:42:18,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 43 transitions. Stem has 1 letters. Loop has 6 letters. 17.32/8.02 [2019-03-29 01:42:18,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.32/8.02 [2019-03-29 01:42:18,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 73 transitions. 17.32/8.02 [2019-03-29 01:42:18,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 17.32/8.02 [2019-03-29 01:42:18,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 26 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:18,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 17.32/8.02 [2019-03-29 01:42:18,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 17.32/8.02 [2019-03-29 01:42:18,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:18,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.32/8.02 [2019-03-29 01:42:18,308 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. 17.32/8.02 [2019-03-29 01:42:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 17.32/8.02 [2019-03-29 01:42:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 17.32/8.02 [2019-03-29 01:42:18,341 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 17.32/8.02 [2019-03-29 01:42:18,342 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 17.32/8.02 [2019-03-29 01:42:18,342 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.32/8.02 [2019-03-29 01:42:18,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. 17.32/8.02 [2019-03-29 01:42:18,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 17.32/8.02 [2019-03-29 01:42:18,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:18,343 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:18,344 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.32/8.02 [2019-03-29 01:42:18,344 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.32/8.02 [2019-03-29 01:42:18,344 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 120#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 127#L12 17.32/8.02 [2019-03-29 01:42:18,345 INFO L796 eck$LassoCheckResult]: Loop: 127#L12 [34] L12-->L16-2: Formula: (and (= 1 (+ v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~i~0_13)) (< (+ v_ULTIMATE.start_main_~w~0_10 v_ULTIMATE.start_main_~i~0_15) 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 116#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 129#L11-2 [45] L11-2-->L12: Formula: (> 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 127#L12 17.32/8.02 [2019-03-29 01:42:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1968, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:18,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash 63688, now seen corresponding path program 2 times 17.32/8.02 [2019-03-29 01:42:18,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:18,363 INFO L82 PathProgramCache]: Analyzing trace with hash 58662585, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:18,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:18,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:18,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:18,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.32/8.02 [2019-03-29 01:42:18,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.32/8.02 [2019-03-29 01:42:18,434 INFO L216 LassoAnalysis]: Preferences: 17.32/8.02 [2019-03-29 01:42:18,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.32/8.02 [2019-03-29 01:42:18,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.32/8.02 [2019-03-29 01:42:18,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.32/8.02 [2019-03-29 01:42:18,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.32/8.02 [2019-03-29 01:42:18,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:18,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.32/8.02 [2019-03-29 01:42:18,435 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.32/8.02 [2019-03-29 01:42:18,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 17.32/8.02 [2019-03-29 01:42:18,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.32/8.02 [2019-03-29 01:42:18,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.32/8.02 [2019-03-29 01:42:18,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:18,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:18,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:18,514 INFO L300 LassoAnalysis]: Preprocessing complete. 17.32/8.02 [2019-03-29 01:42:18,514 INFO L412 LassoAnalysis]: Checking for nontermination... 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:18,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:18,523 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:18,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:18,552 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:18,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:18,559 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:18,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:18,587 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:18,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:18,593 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:18,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:18,628 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:18,769 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.32/8.02 [2019-03-29 01:42:18,772 INFO L216 LassoAnalysis]: Preferences: 17.32/8.02 [2019-03-29 01:42:18,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.32/8.02 [2019-03-29 01:42:18,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.32/8.02 [2019-03-29 01:42:18,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.32/8.02 [2019-03-29 01:42:18,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.32/8.02 [2019-03-29 01:42:18,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:18,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.32/8.02 [2019-03-29 01:42:18,773 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.32/8.02 [2019-03-29 01:42:18,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 17.32/8.02 [2019-03-29 01:42:18,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.32/8.02 [2019-03-29 01:42:18,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.32/8.02 [2019-03-29 01:42:18,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:18,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:18,850 INFO L300 LassoAnalysis]: Preprocessing complete. 17.32/8.02 [2019-03-29 01:42:18,850 INFO L497 LassoAnalysis]: Using template 'affine'. 17.32/8.02 [2019-03-29 01:42:18,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.32/8.02 Termination analysis: LINEAR_WITH_GUESSES 17.32/8.02 Number of strict supporting invariants: 0 17.32/8.02 Number of non-strict supporting invariants: 1 17.32/8.02 Consider only non-deceasing supporting invariants: true 17.32/8.02 Simplify termination arguments: true 17.32/8.02 Simplify supporting invariants: trueOverapproximate stem: false 17.32/8.02 [2019-03-29 01:42:18,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.32/8.02 [2019-03-29 01:42:18,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.32/8.02 [2019-03-29 01:42:18,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.32/8.02 [2019-03-29 01:42:18,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.32/8.02 [2019-03-29 01:42:18,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.32/8.02 [2019-03-29 01:42:18,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.32/8.02 [2019-03-29 01:42:18,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.32/8.02 [2019-03-29 01:42:18,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.32/8.02 Termination analysis: LINEAR_WITH_GUESSES 17.32/8.02 Number of strict supporting invariants: 0 17.32/8.02 Number of non-strict supporting invariants: 1 17.32/8.02 Consider only non-deceasing supporting invariants: true 17.32/8.02 Simplify termination arguments: true 17.32/8.02 Simplify supporting invariants: trueOverapproximate stem: false 17.32/8.02 [2019-03-29 01:42:18,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.32/8.02 [2019-03-29 01:42:18,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.32/8.02 [2019-03-29 01:42:18,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.32/8.02 [2019-03-29 01:42:18,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.32/8.02 [2019-03-29 01:42:18,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.32/8.02 [2019-03-29 01:42:18,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.32/8.02 [2019-03-29 01:42:18,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.32/8.02 [2019-03-29 01:42:18,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.32/8.02 Termination analysis: LINEAR_WITH_GUESSES 17.32/8.02 Number of strict supporting invariants: 0 17.32/8.02 Number of non-strict supporting invariants: 1 17.32/8.02 Consider only non-deceasing supporting invariants: true 17.32/8.02 Simplify termination arguments: true 17.32/8.02 Simplify supporting invariants: trueOverapproximate stem: false 17.32/8.02 [2019-03-29 01:42:18,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.32/8.02 [2019-03-29 01:42:18,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.32/8.02 [2019-03-29 01:42:18,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.32/8.02 [2019-03-29 01:42:18,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.32/8.02 [2019-03-29 01:42:18,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.32/8.02 [2019-03-29 01:42:18,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.32/8.02 [2019-03-29 01:42:18,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.32/8.02 [2019-03-29 01:42:18,876 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.32/8.02 [2019-03-29 01:42:18,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.32/8.02 [2019-03-29 01:42:18,882 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 17.32/8.02 [2019-03-29 01:42:18,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.32/8.02 [2019-03-29 01:42:18,882 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.32/8.02 [2019-03-29 01:42:18,883 INFO L518 LassoAnalysis]: Proved termination. 17.32/8.02 [2019-03-29 01:42:18,883 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.32/8.02 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 17.32/8.02 Supporting invariants [] 17.32/8.02 [2019-03-29 01:42:18,883 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.32/8.02 [2019-03-29 01:42:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:18,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core 17.32/8.02 [2019-03-29 01:42:18,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.32/8.02 [2019-03-29 01:42:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:18,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.32/8.02 [2019-03-29 01:42:18,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.32/8.02 [2019-03-29 01:42:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:18,921 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.32/8.02 [2019-03-29 01:42:18,921 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 2 loop predicates 17.32/8.02 [2019-03-29 01:42:18,921 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 3 states. 17.32/8.02 [2019-03-29 01:42:19,010 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 130 states and 184 transitions. Complement of second has 39 states. 17.32/8.02 [2019-03-29 01:42:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 17.32/8.02 [2019-03-29 01:42:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.32/8.02 [2019-03-29 01:42:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. 17.32/8.02 [2019-03-29 01:42:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 2 letters. Loop has 3 letters. 17.32/8.02 [2019-03-29 01:42:19,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.32/8.02 [2019-03-29 01:42:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. 17.32/8.02 [2019-03-29 01:42:19,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.32/8.02 [2019-03-29 01:42:19,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 2 letters. Loop has 6 letters. 17.32/8.02 [2019-03-29 01:42:19,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.32/8.02 [2019-03-29 01:42:19,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 184 transitions. 17.32/8.02 [2019-03-29 01:42:19,021 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 73 17.32/8.02 [2019-03-29 01:42:19,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 88 states and 131 transitions. 17.32/8.02 [2019-03-29 01:42:19,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 17.32/8.02 [2019-03-29 01:42:19,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 17.32/8.02 [2019-03-29 01:42:19,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 131 transitions. 17.32/8.02 [2019-03-29 01:42:19,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.32/8.02 [2019-03-29 01:42:19,024 INFO L706 BuchiCegarLoop]: Abstraction has 88 states and 131 transitions. 17.32/8.02 [2019-03-29 01:42:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 131 transitions. 17.32/8.02 [2019-03-29 01:42:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 48. 17.32/8.02 [2019-03-29 01:42:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 17.32/8.02 [2019-03-29 01:42:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 78 transitions. 17.32/8.02 [2019-03-29 01:42:19,031 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 78 transitions. 17.32/8.02 [2019-03-29 01:42:19,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.32/8.02 [2019-03-29 01:42:19,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 17.32/8.02 [2019-03-29 01:42:19,035 INFO L87 Difference]: Start difference. First operand 48 states and 78 transitions. Second operand 4 states. 17.32/8.02 [2019-03-29 01:42:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.32/8.02 [2019-03-29 01:42:19,073 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. 17.32/8.02 [2019-03-29 01:42:19,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.32/8.02 [2019-03-29 01:42:19,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 34 transitions. 17.32/8.02 [2019-03-29 01:42:19,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 17.32/8.02 [2019-03-29 01:42:19,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 34 transitions. 17.32/8.02 [2019-03-29 01:42:19,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 17.32/8.02 [2019-03-29 01:42:19,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 17.32/8.02 [2019-03-29 01:42:19,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. 17.32/8.02 [2019-03-29 01:42:19,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.32/8.02 [2019-03-29 01:42:19,078 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. 17.32/8.02 [2019-03-29 01:42:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. 17.32/8.02 [2019-03-29 01:42:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. 17.32/8.02 [2019-03-29 01:42:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 17.32/8.02 [2019-03-29 01:42:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. 17.32/8.02 [2019-03-29 01:42:19,080 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. 17.32/8.02 [2019-03-29 01:42:19,080 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. 17.32/8.02 [2019-03-29 01:42:19,080 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.32/8.02 [2019-03-29 01:42:19,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. 17.32/8.02 [2019-03-29 01:42:19,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 17.32/8.02 [2019-03-29 01:42:19,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:19,081 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:19,082 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.32/8.02 [2019-03-29 01:42:19,082 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 17.32/8.02 [2019-03-29 01:42:19,082 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 412#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 418#L12 17.32/8.02 [2019-03-29 01:42:19,082 INFO L796 eck$LassoCheckResult]: Loop: 418#L12 [43] L12-->L16: Formula: (>= (+ v_ULTIMATE.start_main_~i~0_16 v_ULTIMATE.start_main_~w~0_11) 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} AuxVars[] AssignedVars[] 419#L16 [32] L16-->L16-2: Formula: (and (< v_ULTIMATE.start_main_~w~0_6 v_ULTIMATE.start_main_~i~0_8) (= 0 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~i~0_8 1))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_6} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 415#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 428#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 418#L12 17.32/8.02 [2019-03-29 01:42:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1968, now seen corresponding path program 2 times 17.32/8.02 [2019-03-29 01:42:19,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2236510, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:19,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:19,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.32/8.02 [2019-03-29 01:42:19,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.32/8.02 [2019-03-29 01:42:19,111 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.32/8.02 [2019-03-29 01:42:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.32/8.02 [2019-03-29 01:42:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 17.32/8.02 [2019-03-29 01:42:19,111 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. 17.32/8.02 [2019-03-29 01:42:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.32/8.02 [2019-03-29 01:42:19,152 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. 17.32/8.02 [2019-03-29 01:42:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 17.32/8.02 [2019-03-29 01:42:19,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. 17.32/8.02 [2019-03-29 01:42:19,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 17.32/8.02 [2019-03-29 01:42:19,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:19,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 17.32/8.02 [2019-03-29 01:42:19,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 17.32/8.02 [2019-03-29 01:42:19,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:19,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.32/8.02 [2019-03-29 01:42:19,157 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. 17.32/8.02 [2019-03-29 01:42:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. 17.32/8.02 [2019-03-29 01:42:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 17.32/8.02 [2019-03-29 01:42:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. 17.32/8.02 [2019-03-29 01:42:19,160 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. 17.32/8.02 [2019-03-29 01:42:19,160 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. 17.32/8.02 [2019-03-29 01:42:19,160 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 17.32/8.02 [2019-03-29 01:42:19,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. 17.32/8.02 [2019-03-29 01:42:19,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 17.32/8.02 [2019-03-29 01:42:19,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:19,161 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:19,162 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.32/8.02 [2019-03-29 01:42:19,162 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 17.32/8.02 [2019-03-29 01:42:19,162 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 478#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 487#L12 17.32/8.02 [2019-03-29 01:42:19,162 INFO L796 eck$LassoCheckResult]: Loop: 487#L12 [43] L12-->L16: Formula: (>= (+ v_ULTIMATE.start_main_~i~0_16 v_ULTIMATE.start_main_~w~0_11) 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} AuxVars[] AssignedVars[] 499#L16 [44] L16-->L16-2: Formula: (and (>= v_ULTIMATE.start_main_~w~0_7 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~i~0_9 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 474#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 483#L11-2 [45] L11-2-->L12: Formula: (> 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 487#L12 17.32/8.02 [2019-03-29 01:42:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1968, now seen corresponding path program 3 times 17.32/8.02 [2019-03-29 01:42:19,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2248041, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:19,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.32/8.02 [2019-03-29 01:42:19,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.32/8.02 [2019-03-29 01:42:19,180 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.32/8.02 [2019-03-29 01:42:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.32/8.02 [2019-03-29 01:42:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.32/8.02 [2019-03-29 01:42:19,181 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 13 Second operand 3 states. 17.32/8.02 [2019-03-29 01:42:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.32/8.02 [2019-03-29 01:42:19,206 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. 17.32/8.02 [2019-03-29 01:42:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.32/8.02 [2019-03-29 01:42:19,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. 17.32/8.02 [2019-03-29 01:42:19,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 17.32/8.02 [2019-03-29 01:42:19,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 39 transitions. 17.32/8.02 [2019-03-29 01:42:19,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 17.32/8.02 [2019-03-29 01:42:19,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 17.32/8.02 [2019-03-29 01:42:19,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. 17.32/8.02 [2019-03-29 01:42:19,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.32/8.02 [2019-03-29 01:42:19,213 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. 17.32/8.02 [2019-03-29 01:42:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. 17.32/8.02 [2019-03-29 01:42:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. 17.32/8.02 [2019-03-29 01:42:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 17.32/8.02 [2019-03-29 01:42:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. 17.32/8.02 [2019-03-29 01:42:19,216 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 17.32/8.02 [2019-03-29 01:42:19,216 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 17.32/8.02 [2019-03-29 01:42:19,216 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 17.32/8.02 [2019-03-29 01:42:19,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. 17.32/8.02 [2019-03-29 01:42:19,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 17.32/8.02 [2019-03-29 01:42:19,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:19,217 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:19,217 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.32/8.02 [2019-03-29 01:42:19,217 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 17.32/8.02 [2019-03-29 01:42:19,218 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 539#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 548#L12 17.32/8.02 [2019-03-29 01:42:19,218 INFO L796 eck$LassoCheckResult]: Loop: 548#L12 [43] L12-->L16: Formula: (>= (+ v_ULTIMATE.start_main_~i~0_16 v_ULTIMATE.start_main_~w~0_11) 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} AuxVars[] AssignedVars[] 554#L16 [44] L16-->L16-2: Formula: (and (>= v_ULTIMATE.start_main_~w~0_7 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~i~0_9 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 537#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 549#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 548#L12 17.32/8.02 [2019-03-29 01:42:19,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1968, now seen corresponding path program 4 times 17.32/8.02 [2019-03-29 01:42:19,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2248042, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:19,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:19,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.32/8.02 [2019-03-29 01:42:19,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.32/8.02 [2019-03-29 01:42:19,236 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.32/8.02 [2019-03-29 01:42:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.32/8.02 [2019-03-29 01:42:19,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.32/8.02 [2019-03-29 01:42:19,237 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. 17.32/8.02 [2019-03-29 01:42:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.32/8.02 [2019-03-29 01:42:19,249 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. 17.32/8.02 [2019-03-29 01:42:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.32/8.02 [2019-03-29 01:42:19,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. 17.32/8.02 [2019-03-29 01:42:19,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 17.32/8.02 [2019-03-29 01:42:19,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 23 transitions. 17.32/8.02 [2019-03-29 01:42:19,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 17.32/8.02 [2019-03-29 01:42:19,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 17.32/8.02 [2019-03-29 01:42:19,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. 17.32/8.02 [2019-03-29 01:42:19,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.32/8.02 [2019-03-29 01:42:19,253 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. 17.32/8.02 [2019-03-29 01:42:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. 17.32/8.02 [2019-03-29 01:42:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. 17.32/8.02 [2019-03-29 01:42:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 17.32/8.02 [2019-03-29 01:42:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. 17.32/8.02 [2019-03-29 01:42:19,255 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 17.32/8.02 [2019-03-29 01:42:19,255 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 17.32/8.02 [2019-03-29 01:42:19,255 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 17.32/8.02 [2019-03-29 01:42:19,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. 17.32/8.02 [2019-03-29 01:42:19,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 17.32/8.02 [2019-03-29 01:42:19,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:19,256 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:19,256 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.32/8.02 [2019-03-29 01:42:19,256 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] 17.32/8.02 [2019-03-29 01:42:19,256 INFO L794 eck$LassoCheckResult]: Stem: 587#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 588#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 594#L12 17.32/8.02 [2019-03-29 01:42:19,257 INFO L796 eck$LassoCheckResult]: Loop: 594#L12 [43] L12-->L16: Formula: (>= (+ v_ULTIMATE.start_main_~i~0_16 v_ULTIMATE.start_main_~w~0_11) 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} AuxVars[] AssignedVars[] 585#L16 [32] L16-->L16-2: Formula: (and (< v_ULTIMATE.start_main_~w~0_6 v_ULTIMATE.start_main_~i~0_8) (= 0 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~i~0_8 1))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_6} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 586#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 598#L11-2 [45] L11-2-->L12: Formula: (> 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 589#L12 [34] L12-->L16-2: Formula: (and (= 1 (+ v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~i~0_13)) (< (+ v_ULTIMATE.start_main_~w~0_10 v_ULTIMATE.start_main_~i~0_15) 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 590#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 591#L11-2 [45] L11-2-->L12: Formula: (> 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 594#L12 17.32/8.02 [2019-03-29 01:42:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1968, now seen corresponding path program 5 times 17.32/8.02 [2019-03-29 01:42:19,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2091603220, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:19,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.32/8.02 [2019-03-29 01:42:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.32/8.02 [2019-03-29 01:42:19,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.32/8.02 [2019-03-29 01:42:19,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.32/8.02 [2019-03-29 01:42:19,281 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.32/8.02 [2019-03-29 01:42:19,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.32/8.02 [2019-03-29 01:42:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 17.32/8.02 [2019-03-29 01:42:19,282 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. 17.32/8.02 [2019-03-29 01:42:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.32/8.02 [2019-03-29 01:42:19,302 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. 17.32/8.02 [2019-03-29 01:42:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.32/8.02 [2019-03-29 01:42:19,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. 17.32/8.02 [2019-03-29 01:42:19,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 17.32/8.02 [2019-03-29 01:42:19,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. 17.32/8.02 [2019-03-29 01:42:19,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 17.32/8.02 [2019-03-29 01:42:19,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 17.32/8.02 [2019-03-29 01:42:19,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. 17.32/8.02 [2019-03-29 01:42:19,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.32/8.02 [2019-03-29 01:42:19,306 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. 17.32/8.02 [2019-03-29 01:42:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. 17.32/8.02 [2019-03-29 01:42:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 10. 17.32/8.02 [2019-03-29 01:42:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 17.32/8.02 [2019-03-29 01:42:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. 17.32/8.02 [2019-03-29 01:42:19,308 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. 17.32/8.02 [2019-03-29 01:42:19,308 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. 17.32/8.02 [2019-03-29 01:42:19,308 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 17.32/8.02 [2019-03-29 01:42:19,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. 17.32/8.02 [2019-03-29 01:42:19,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 17.32/8.02 [2019-03-29 01:42:19,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.32/8.02 [2019-03-29 01:42:19,308 INFO L119 BuchiIsEmpty]: Starting construction of run 17.32/8.02 [2019-03-29 01:42:19,309 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.32/8.02 [2019-03-29 01:42:19,309 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] 17.32/8.02 [2019-03-29 01:42:19,309 INFO L794 eck$LassoCheckResult]: Stem: 633#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~w~0_1 5) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~w~0] 634#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 640#L12 17.32/8.02 [2019-03-29 01:42:19,310 INFO L796 eck$LassoCheckResult]: Loop: 640#L12 [43] L12-->L16: Formula: (>= (+ v_ULTIMATE.start_main_~i~0_16 v_ULTIMATE.start_main_~w~0_11) 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_11} AuxVars[] AssignedVars[] 635#L16 [32] L16-->L16-2: Formula: (and (< v_ULTIMATE.start_main_~w~0_6 v_ULTIMATE.start_main_~i~0_8) (= 0 (+ v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~i~0_8 1))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_6} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 636#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 639#L11-2 [45] L11-2-->L12: Formula: (> 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 637#L12 [34] L12-->L16-2: Formula: (and (= 1 (+ v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~i~0_13)) (< (+ v_ULTIMATE.start_main_~w~0_10 v_ULTIMATE.start_main_~i~0_15) 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 638#L16-2 [38] L16-2-->L11-2: Formula: (= v_ULTIMATE.start_main_~w~0_8 (+ v_ULTIMATE.start_main_~w~0_9 1)) InVars {ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_9} OutVars{ULTIMATE.start_main_~w~0=v_ULTIMATE.start_main_~w~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~w~0] 642#L11-2 [46] L11-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~i~0_12) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 640#L12 17.32/8.02 [2019-03-29 01:42:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1968, now seen corresponding path program 6 times 17.32/8.02 [2019-03-29 01:42:19,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2091603219, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:19,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.32/8.02 [2019-03-29 01:42:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1367576482, now seen corresponding path program 1 times 17.32/8.02 [2019-03-29 01:42:19,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.32/8.02 [2019-03-29 01:42:19,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.32/8.02 [2019-03-29 01:42:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.32/8.02 [2019-03-29 01:42:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.32/8.02 [2019-03-29 01:42:19,376 INFO L216 LassoAnalysis]: Preferences: 17.32/8.02 [2019-03-29 01:42:19,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.32/8.02 [2019-03-29 01:42:19,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.32/8.02 [2019-03-29 01:42:19,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.32/8.02 [2019-03-29 01:42:19,393 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.32/8.02 [2019-03-29 01:42:19,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.32/8.02 [2019-03-29 01:42:19,394 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.32/8.02 [2019-03-29 01:42:19,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 17.32/8.02 [2019-03-29 01:42:19,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.32/8.02 [2019-03-29 01:42:19,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.32/8.02 [2019-03-29 01:42:19,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,450 INFO L300 LassoAnalysis]: Preprocessing complete. 17.32/8.02 [2019-03-29 01:42:19,450 INFO L412 LassoAnalysis]: Checking for nontermination... 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,453 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,484 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~w~0=0} Honda state: {ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~w~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~w~0=1}, {ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~w~0=1}, {ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~w~0=0}] Lambdas: [1, 1, 8] Nus: [0, 0] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,541 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,572 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,599 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 [2019-03-29 01:42:19,610 INFO L216 LassoAnalysis]: Preferences: 17.32/8.02 [2019-03-29 01:42:19,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.32/8.02 [2019-03-29 01:42:19,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.32/8.02 [2019-03-29 01:42:19,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.32/8.02 [2019-03-29 01:42:19,610 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.32/8.02 [2019-03-29 01:42:19,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.32/8.02 [2019-03-29 01:42:19,611 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.32/8.02 [2019-03-29 01:42:19,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 17.32/8.02 [2019-03-29 01:42:19,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.32/8.02 [2019-03-29 01:42:19,611 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.32/8.02 [2019-03-29 01:42:19,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.32/8.02 [2019-03-29 01:42:19,685 INFO L300 LassoAnalysis]: Preprocessing complete. 17.32/8.02 [2019-03-29 01:42:19,685 INFO L412 LassoAnalysis]: Checking for nontermination... 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,689 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,697 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,724 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,728 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,728 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,758 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_6=1} Honda state: {v_rep~unnamed0~0~true_6=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,792 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,824 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,854 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,854 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~w~0=0, ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~w~0=5, ULTIMATE.start_main_~i~0=14} Generalized eigenvectors: [{ULTIMATE.start_main_~w~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~w~0=0, ULTIMATE.start_main_~i~0=0}, {ULTIMATE.start_main_~w~0=2, ULTIMATE.start_main_~i~0=2}] Lambdas: [0, 2, 1] Nus: [0, 0] 17.32/8.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.32/8.02 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.32/8.02 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.32/8.02 [2019-03-29 01:42:19,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.32/8.02 [2019-03-29 01:42:19,881 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.32/8.02 [2019-03-29 01:42:19,910 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.32/8.02 [2019-03-29 01:42:19,910 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_6=0} Honda state: {v_rep~unnamed0~0~false_6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.32/8.02 [2019-03-29 01:42:19,920 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 01:42:19 BasicIcfg 17.32/8.02 [2019-03-29 01:42:19,936 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.32/8.02 [2019-03-29 01:42:19,936 INFO L168 Benchmark]: Toolchain (without parser) took 3535.35 ms. Allocated memory was 649.6 MB in the beginning and 742.9 MB in the end (delta: 93.3 MB). Free memory was 557.1 MB in the beginning and 627.3 MB in the end (delta: -70.2 MB). Peak memory consumption was 217.6 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,938 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.02 ms. Allocated memory is still 649.6 MB. Free memory was 557.1 MB in the beginning and 547.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.06 ms. Allocated memory was 649.6 MB in the beginning and 663.2 MB in the end (delta: 13.6 MB). Free memory was 547.4 MB in the beginning and 630.0 MB in the end (delta: -82.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,939 INFO L168 Benchmark]: Boogie Preprocessor took 21.00 ms. Allocated memory is still 663.2 MB. Free memory was 630.0 MB in the beginning and 627.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,940 INFO L168 Benchmark]: RCFGBuilder took 227.13 ms. Allocated memory is still 663.2 MB. Free memory was 627.1 MB in the beginning and 614.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,940 INFO L168 Benchmark]: BlockEncodingV2 took 82.67 ms. Allocated memory is still 663.2 MB. Free memory was 614.1 MB in the beginning and 608.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,941 INFO L168 Benchmark]: TraceAbstraction took 157.12 ms. Allocated memory is still 663.2 MB. Free memory was 608.7 MB in the beginning and 600.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,941 INFO L168 Benchmark]: BuchiAutomizer took 2711.96 ms. Allocated memory was 663.2 MB in the beginning and 742.9 MB in the end (delta: 79.7 MB). Free memory was 600.0 MB in the beginning and 627.3 MB in the end (delta: -27.3 MB). Peak memory consumption was 246.9 MB. Max. memory is 50.3 GB. 17.32/8.02 [2019-03-29 01:42:19,945 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.32/8.02 --- Results --- 17.32/8.02 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.32/8.02 - StatisticsResult: Initial Icfg 17.32/8.02 9 locations, 12 edges 17.32/8.02 - StatisticsResult: Encoded RCFG 17.32/8.02 5 locations, 8 edges 17.32/8.02 * Results from de.uni_freiburg.informatik.ultimate.core: 17.32/8.02 - StatisticsResult: Toolchain Benchmarks 17.32/8.02 Benchmark results are: 17.32/8.02 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.32/8.02 * CACSL2BoogieTranslator took 231.02 ms. Allocated memory is still 649.6 MB. Free memory was 557.1 MB in the beginning and 547.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 17.32/8.02 * Boogie Procedure Inliner took 99.06 ms. Allocated memory was 649.6 MB in the beginning and 663.2 MB in the end (delta: 13.6 MB). Free memory was 547.4 MB in the beginning and 630.0 MB in the end (delta: -82.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 50.3 GB. 17.32/8.02 * Boogie Preprocessor took 21.00 ms. Allocated memory is still 663.2 MB. Free memory was 630.0 MB in the beginning and 627.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 17.32/8.02 * RCFGBuilder took 227.13 ms. Allocated memory is still 663.2 MB. Free memory was 627.1 MB in the beginning and 614.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. 17.32/8.02 * BlockEncodingV2 took 82.67 ms. Allocated memory is still 663.2 MB. Free memory was 614.1 MB in the beginning and 608.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.32/8.02 * TraceAbstraction took 157.12 ms. Allocated memory is still 663.2 MB. Free memory was 608.7 MB in the beginning and 600.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 17.32/8.02 * BuchiAutomizer took 2711.96 ms. Allocated memory was 663.2 MB in the beginning and 742.9 MB in the end (delta: 79.7 MB). Free memory was 600.0 MB in the beginning and 627.3 MB in the end (delta: -27.3 MB). Peak memory consumption was 246.9 MB. Max. memory is 50.3 GB. 17.32/8.02 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 - GenericResult: Unfinished Backtranslation 17.32/8.02 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.32/8.02 - AllSpecificationsHoldResult: All specifications hold 17.32/8.02 We were not able to verify any specifiation because the program does not contain any specification. 17.32/8.02 - InvariantResult [Line: 11]: Loop Invariant 17.32/8.02 Derived loop invariant: 1 17.32/8.02 - StatisticsResult: Ultimate Automizer benchmark data 17.32/8.02 CFG has 1 procedures, 5 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=5occurred 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 17.32/8.02 - StatisticsResult: Constructed decomposition of program 17.32/8.02 Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * i and consists of 9 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 10 locations. 17.32/8.02 - StatisticsResult: Timing statistics 17.32/8.02 BüchiAutomizer plugin needed 2.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 80 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 58 SDslu, 20 SDs, 0 SdLazy, 230 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax157 hnf100 lsp63 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf105 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 17.32/8.02 - TerminationAnalysisResult: Nontermination possible 17.32/8.02 Buchi Automizer proved that your program is nonterminating for some inputs 17.32/8.02 - GeometricNonTerminationArgumentResult [Line: 12]: Nontermination argument in form of an infinite program execution. 17.32/8.02 [2019-03-29 01:42:19,954 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 [2019-03-29 01:42:19,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~true 17.32/8.02 [2019-03-29 01:42:19,961 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~unnamed0~0~false 17.32/8.02 Nontermination argument in form of an infinite execution 17.32/8.02 {|ULTIMATE.start_main_#t~nondet0|=0, ~unnamed0~0~true=1, ULTIMATE.start_main_~i~0=0, |ULTIMATE.start_main_#res|=0, ULTIMATE.start_main_~w~0=0, ~unnamed0~0~false=0} 17.32/8.02 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454cc20=0, ~unnamed0~0~true=1, \result=0, w=5, ~unnamed0~0~false=0, i=14} 17.32/8.02 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454cc20=0, ~unnamed0~0~true=1, \result=0, w=7, ~unnamed0~0~false=0, i=16} 17.32/8.02 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454cc20=0, ~unnamed0~0~true=1, \result=0, w=9, ~unnamed0~0~false=0, i=18} 17.32/8.02 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454cc20=0, ~unnamed0~0~true=1, \result=0, w=11, ~unnamed0~0~false=0, i=20} 17.32/8.02 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454cc20=0, ~unnamed0~0~true=1, \result=0, w=13, ~unnamed0~0~false=0, i=22} 17.32/8.02 - StatisticsResult: NonterminationArgumentStatistics 17.32/8.02 Unbounded Execution 1GEVs Lambdas: [0, 2, 1] Mus: [0, 0] 17.32/8.02 - NonterminatingLassoResult [Line: 12]: Nonterminating execution 17.32/8.02 Found a nonterminating execution for the following lasso shaped sequence of statements. 17.32/8.02 Stem: 17.32/8.02 [L6] int i; 17.32/8.02 [L7] int w; 17.32/8.02 [L8] i = __VERIFIER_nondet_int() 17.32/8.02 [L9] w = 5 17.32/8.02 [L11] COND TRUE i != 0 17.32/8.02 Loop: 17.32/8.02 [L12] COND FALSE !(i < -w) 17.32/8.02 [L16] COND TRUE i > w 17.32/8.02 [L17] i = i+1 17.32/8.02 [L18] i = i*(-1) 17.32/8.02 [L23] w = w+1 17.32/8.02 [L11] COND TRUE i != 0 17.32/8.02 [L12] COND TRUE i < -w 17.32/8.02 [L13] i = i-1 17.32/8.02 [L14] i = i*(-1) 17.32/8.02 [L23] w = w+1 17.32/8.02 [L11] COND TRUE i != 0 17.32/8.02 End of lasso representation. 17.32/8.02 RESULT: Ultimate proved your program to be incorrect! 17.32/8.02 !SESSION 2019-03-29 01:42:13.126 ----------------------------------------------- 17.32/8.02 eclipse.buildId=unknown 17.32/8.02 java.version=1.8.0_181 17.32/8.02 java.vendor=Oracle Corporation 17.32/8.02 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.32/8.02 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.32/8.02 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.32/8.02 17.32/8.02 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 01:42:20.186 17.32/8.02 !MESSAGE The workspace will exit with unsaved changes in this session. 17.32/8.02 Received shutdown request... 17.32/8.02 Ultimate: 17.32/8.02 GTK+ Version Check 17.32/8.02 EOF