22.49/10.32 YES 22.49/10.32 22.49/10.32 Ultimate: Cannot open display: 22.49/10.32 This is Ultimate 0.1.24-8dc7c08-m 22.49/10.32 [2019-03-28 12:06:30,388 INFO L170 SettingsManager]: Resetting all preferences to default values... 22.49/10.32 [2019-03-28 12:06:30,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 22.49/10.32 [2019-03-28 12:06:30,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 22.49/10.32 [2019-03-28 12:06:30,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 22.49/10.32 [2019-03-28 12:06:30,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 22.49/10.32 [2019-03-28 12:06:30,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 22.49/10.32 [2019-03-28 12:06:30,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 22.49/10.32 [2019-03-28 12:06:30,408 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 22.49/10.32 [2019-03-28 12:06:30,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 22.49/10.32 [2019-03-28 12:06:30,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 22.49/10.32 [2019-03-28 12:06:30,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 22.49/10.32 [2019-03-28 12:06:30,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 22.49/10.32 [2019-03-28 12:06:30,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 22.49/10.32 [2019-03-28 12:06:30,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 22.49/10.32 [2019-03-28 12:06:30,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 22.49/10.32 [2019-03-28 12:06:30,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 22.49/10.32 [2019-03-28 12:06:30,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 22.49/10.32 [2019-03-28 12:06:30,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 22.49/10.32 [2019-03-28 12:06:30,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 22.49/10.32 [2019-03-28 12:06:30,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 22.49/10.32 [2019-03-28 12:06:30,423 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 22.49/10.32 [2019-03-28 12:06:30,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 22.49/10.32 [2019-03-28 12:06:30,425 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 22.49/10.32 [2019-03-28 12:06:30,426 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 22.49/10.32 [2019-03-28 12:06:30,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 22.49/10.32 [2019-03-28 12:06:30,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 22.49/10.32 [2019-03-28 12:06:30,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 22.49/10.32 [2019-03-28 12:06:30,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 22.49/10.32 [2019-03-28 12:06:30,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 22.49/10.32 [2019-03-28 12:06:30,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 22.49/10.32 [2019-03-28 12:06:30,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 22.49/10.32 [2019-03-28 12:06:30,431 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 22.49/10.32 [2019-03-28 12:06:30,447 INFO L110 SettingsManager]: Loading preferences was successful 22.49/10.32 [2019-03-28 12:06:30,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 22.49/10.32 [2019-03-28 12:06:30,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 22.49/10.32 [2019-03-28 12:06:30,448 INFO L133 SettingsManager]: * Rewrite not-equals=true 22.49/10.32 [2019-03-28 12:06:30,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 22.49/10.32 [2019-03-28 12:06:30,449 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 22.49/10.32 [2019-03-28 12:06:30,449 INFO L133 SettingsManager]: * Use SBE=true 22.49/10.32 [2019-03-28 12:06:30,449 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 22.49/10.32 [2019-03-28 12:06:30,449 INFO L133 SettingsManager]: * Use old map elimination=false 22.49/10.32 [2019-03-28 12:06:30,449 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 22.49/10.32 [2019-03-28 12:06:30,449 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 22.49/10.32 [2019-03-28 12:06:30,450 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 22.49/10.32 [2019-03-28 12:06:30,450 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 22.49/10.32 [2019-03-28 12:06:30,450 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 22.49/10.32 [2019-03-28 12:06:30,450 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:30,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 22.49/10.32 [2019-03-28 12:06:30,451 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 22.49/10.32 [2019-03-28 12:06:30,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE 22.49/10.32 [2019-03-28 12:06:30,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 22.49/10.32 [2019-03-28 12:06:30,451 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 22.49/10.32 [2019-03-28 12:06:30,451 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 22.49/10.32 [2019-03-28 12:06:30,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 22.49/10.32 [2019-03-28 12:06:30,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 22.49/10.32 [2019-03-28 12:06:30,452 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 22.49/10.32 [2019-03-28 12:06:30,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.49/10.32 [2019-03-28 12:06:30,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 22.49/10.32 [2019-03-28 12:06:30,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 22.49/10.32 [2019-03-28 12:06:30,453 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 22.49/10.32 [2019-03-28 12:06:30,453 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 22.49/10.32 [2019-03-28 12:06:30,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 22.49/10.32 [2019-03-28 12:06:30,492 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 22.49/10.32 [2019-03-28 12:06:30,496 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 22.49/10.32 [2019-03-28 12:06:30,497 INFO L271 PluginConnector]: Initializing CDTParser... 22.49/10.32 [2019-03-28 12:06:30,497 INFO L276 PluginConnector]: CDTParser initialized 22.49/10.32 [2019-03-28 12:06:30,498 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 22.49/10.32 [2019-03-28 12:06:30,596 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/f50f2e4ddb65471fa038864497c28b2e/FLAG6001054bc 22.49/10.32 [2019-03-28 12:06:30,938 INFO L307 CDTParser]: Found 1 translation units. 22.49/10.32 [2019-03-28 12:06:30,939 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 22.49/10.32 [2019-03-28 12:06:30,945 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/f50f2e4ddb65471fa038864497c28b2e/FLAG6001054bc 22.49/10.32 [2019-03-28 12:06:31,343 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/f50f2e4ddb65471fa038864497c28b2e 22.49/10.32 [2019-03-28 12:06:31,354 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 22.49/10.32 [2019-03-28 12:06:31,356 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 22.49/10.32 [2019-03-28 12:06:31,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 22.49/10.32 [2019-03-28 12:06:31,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 22.49/10.32 [2019-03-28 12:06:31,361 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 22.49/10.32 [2019-03-28 12:06:31,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae72933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:31,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 22.49/10.32 [2019-03-28 12:06:31,390 INFO L176 MainTranslator]: Built tables and reachable declarations 22.49/10.32 [2019-03-28 12:06:31,546 INFO L206 PostProcessor]: Analyzing one entry point: main 22.49/10.32 [2019-03-28 12:06:31,551 INFO L191 MainTranslator]: Completed pre-run 22.49/10.32 [2019-03-28 12:06:31,567 INFO L206 PostProcessor]: Analyzing one entry point: main 22.49/10.32 [2019-03-28 12:06:31,647 INFO L195 MainTranslator]: Completed translation 22.49/10.32 [2019-03-28 12:06:31,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31 WrapperNode 22.49/10.32 [2019-03-28 12:06:31,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 22.49/10.32 [2019-03-28 12:06:31,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 22.49/10.32 [2019-03-28 12:06:31,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 22.49/10.32 [2019-03-28 12:06:31,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 22.49/10.32 [2019-03-28 12:06:31,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 22.49/10.32 [2019-03-28 12:06:31,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 22.49/10.32 [2019-03-28 12:06:31,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 22.49/10.32 [2019-03-28 12:06:31,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized 22.49/10.32 [2019-03-28 12:06:31,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 22.49/10.32 [2019-03-28 12:06:31,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 22.49/10.32 [2019-03-28 12:06:31,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... 22.49/10.32 [2019-03-28 12:06:31,707 INFO L276 PluginConnector]: RCFGBuilder initialized 22.49/10.32 [2019-03-28 12:06:31,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (1/1) ... 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.49/10.32 [2019-03-28 12:06:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 22.49/10.32 [2019-03-28 12:06:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 22.49/10.32 [2019-03-28 12:06:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 22.49/10.32 [2019-03-28 12:06:31,779 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 22.49/10.32 [2019-03-28 12:06:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 22.49/10.32 [2019-03-28 12:06:31,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 22.49/10.32 [2019-03-28 12:06:31,928 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 22.49/10.32 [2019-03-28 12:06:31,928 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 22.49/10.32 [2019-03-28 12:06:31,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:31 BoogieIcfgContainer 22.49/10.32 [2019-03-28 12:06:31,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 22.49/10.32 [2019-03-28 12:06:31,931 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 22.49/10.32 [2019-03-28 12:06:31,931 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 22.49/10.32 [2019-03-28 12:06:31,933 INFO L276 PluginConnector]: BlockEncodingV2 initialized 22.49/10.32 [2019-03-28 12:06:31,934 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:31" (1/1) ... 22.49/10.32 [2019-03-28 12:06:31,951 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 26 edges 22.49/10.32 [2019-03-28 12:06:31,953 INFO L258 BlockEncoder]: Using Remove infeasible edges 22.49/10.32 [2019-03-28 12:06:31,954 INFO L263 BlockEncoder]: Using Maximize final states 22.49/10.32 [2019-03-28 12:06:31,955 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 22.49/10.32 [2019-03-28 12:06:31,955 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 22.49/10.32 [2019-03-28 12:06:31,957 INFO L296 BlockEncoder]: Using Remove sink states 22.49/10.32 [2019-03-28 12:06:31,958 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 22.49/10.32 [2019-03-28 12:06:31,958 INFO L179 BlockEncoder]: Using Rewrite not-equals 22.49/10.32 [2019-03-28 12:06:31,973 INFO L185 BlockEncoder]: Using Use SBE 22.49/10.32 [2019-03-28 12:06:31,982 INFO L200 BlockEncoder]: SBE split 0 edges 22.49/10.32 [2019-03-28 12:06:31,987 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 22.49/10.32 [2019-03-28 12:06:31,989 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.49/10.32 [2019-03-28 12:06:32,000 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 22.49/10.32 [2019-03-28 12:06:32,002 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 22.49/10.32 [2019-03-28 12:06:32,004 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 22.49/10.32 [2019-03-28 12:06:32,004 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.49/10.32 [2019-03-28 12:06:32,005 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 22.49/10.32 [2019-03-28 12:06:32,005 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 22.49/10.32 [2019-03-28 12:06:32,006 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 22 edges 22.49/10.32 [2019-03-28 12:06:32,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:32 BasicIcfg 22.49/10.32 [2019-03-28 12:06:32,006 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 22.49/10.32 [2019-03-28 12:06:32,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 22.49/10.32 [2019-03-28 12:06:32,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... 22.49/10.32 [2019-03-28 12:06:32,011 INFO L276 PluginConnector]: TraceAbstraction initialized 22.49/10.32 [2019-03-28 12:06:32,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:06:31" (1/4) ... 22.49/10.32 [2019-03-28 12:06:32,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603da54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (2/4) ... 22.49/10.32 [2019-03-28 12:06:32,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603da54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:31" (3/4) ... 22.49/10.32 [2019-03-28 12:06:32,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603da54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:32" (4/4) ... 22.49/10.32 [2019-03-28 12:06:32,015 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.49/10.32 [2019-03-28 12:06:32,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 22.49/10.32 [2019-03-28 12:06:32,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 22.49/10.32 [2019-03-28 12:06:32,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 22.49/10.32 [2019-03-28 12:06:32,083 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.49/10.32 [2019-03-28 12:06:32,084 INFO L382 AbstractCegarLoop]: Interprodecural is true 22.49/10.32 [2019-03-28 12:06:32,084 INFO L383 AbstractCegarLoop]: Hoare is true 22.49/10.32 [2019-03-28 12:06:32,084 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 22.49/10.32 [2019-03-28 12:06:32,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 22.49/10.32 [2019-03-28 12:06:32,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.49/10.32 [2019-03-28 12:06:32,084 INFO L387 AbstractCegarLoop]: Difference is false 22.49/10.32 [2019-03-28 12:06:32,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 22.49/10.32 [2019-03-28 12:06:32,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 22.49/10.32 [2019-03-28 12:06:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. 22.49/10.32 [2019-03-28 12:06:32,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 22.49/10.32 [2019-03-28 12:06:32,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. 22.49/10.32 [2019-03-28 12:06:32,186 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,186 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,187 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,187 INFO L451 ceAbstractionStarter]: At program point L14-1(line 14) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,187 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,187 INFO L451 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,188 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,188 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,188 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,188 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,188 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,189 INFO L451 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,189 INFO L451 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,189 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,189 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,189 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 22.49/10.32 [2019-03-28 12:06:32,190 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true 22.49/10.32 [2019-03-28 12:06:32,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:32 BasicIcfg 22.49/10.32 [2019-03-28 12:06:32,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 22.49/10.32 [2019-03-28 12:06:32,194 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 22.49/10.32 [2019-03-28 12:06:32,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 22.49/10.32 [2019-03-28 12:06:32,198 INFO L276 PluginConnector]: BuchiAutomizer initialized 22.49/10.32 [2019-03-28 12:06:32,199 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.49/10.32 [2019-03-28 12:06:32,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:06:31" (1/5) ... 22.49/10.32 [2019-03-28 12:06:32,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6a69d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.49/10.32 [2019-03-28 12:06:32,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:06:31" (2/5) ... 22.49/10.32 [2019-03-28 12:06:32,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6a69d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.49/10.32 [2019-03-28 12:06:32,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:06:31" (3/5) ... 22.49/10.32 [2019-03-28 12:06:32,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6a69d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.49/10.32 [2019-03-28 12:06:32,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:06:32" (4/5) ... 22.49/10.32 [2019-03-28 12:06:32,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6a69d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:32, skipping insertion in model container 22.49/10.32 [2019-03-28 12:06:32,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.49/10.32 [2019-03-28 12:06:32,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:06:32" (5/5) ... 22.49/10.32 [2019-03-28 12:06:32,203 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.49/10.32 [2019-03-28 12:06:32,232 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.49/10.32 [2019-03-28 12:06:32,232 INFO L374 BuchiCegarLoop]: Interprodecural is true 22.49/10.32 [2019-03-28 12:06:32,232 INFO L375 BuchiCegarLoop]: Hoare is true 22.49/10.32 [2019-03-28 12:06:32,232 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 22.49/10.32 [2019-03-28 12:06:32,232 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 22.49/10.32 [2019-03-28 12:06:32,232 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.49/10.32 [2019-03-28 12:06:32,233 INFO L379 BuchiCegarLoop]: Difference is false 22.49/10.32 [2019-03-28 12:06:32,233 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 22.49/10.32 [2019-03-28 12:06:32,233 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 22.49/10.32 [2019-03-28 12:06:32,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. 22.49/10.32 [2019-03-28 12:06:32,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:32,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:32,260 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:32,268 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 22.49/10.32 [2019-03-28 12:06:32,268 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:32,268 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 22.49/10.32 [2019-03-28 12:06:32,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. 22.49/10.32 [2019-03-28 12:06:32,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:32,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:32,271 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:32,271 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 22.49/10.32 [2019-03-28 12:06:32,271 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:32,277 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 18#L25true [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue 22.49/10.32 [2019-03-28 12:06:32,278 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 16#L18true [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 15#L20true [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 4#rec1ENTRYtrue [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 9#L12true [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 5#rec1FINALtrue [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12#rec1EXITtrue >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 19#L20-1true [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue 22.49/10.32 [2019-03-28 12:06:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:32,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:32,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1865651641, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:32,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:32,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:32,376 INFO L82 PathProgramCache]: Analyzing trace with hash -639583504, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:32,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:32,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:32,530 INFO L216 LassoAnalysis]: Preferences: 22.49/10.32 [2019-03-28 12:06:32,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.49/10.32 [2019-03-28 12:06:32,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.49/10.32 [2019-03-28 12:06:32,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.49/10.32 [2019-03-28 12:06:32,531 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.49/10.32 [2019-03-28 12:06:32,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.49/10.32 [2019-03-28 12:06:32,532 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.49/10.32 [2019-03-28 12:06:32,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 22.49/10.32 [2019-03-28 12:06:32,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.49/10.32 [2019-03-28 12:06:32,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.49/10.32 [2019-03-28 12:06:32,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,626 INFO L300 LassoAnalysis]: Preprocessing complete. 22.49/10.32 [2019-03-28 12:06:32,627 INFO L412 LassoAnalysis]: Checking for nontermination... 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:32,633 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:32,644 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.49/10.32 [2019-03-28 12:06:32,644 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:32,674 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:32,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.49/10.32 [2019-03-28 12:06:32,678 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:32,705 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:32,709 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.49/10.32 [2019-03-28 12:06:32,709 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:32,736 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:32,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.49/10.32 [2019-03-28 12:06:32,740 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:32,769 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:32,801 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:32,807 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.49/10.32 [2019-03-28 12:06:32,831 INFO L216 LassoAnalysis]: Preferences: 22.49/10.32 [2019-03-28 12:06:32,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.49/10.32 [2019-03-28 12:06:32,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.49/10.32 [2019-03-28 12:06:32,832 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.49/10.32 [2019-03-28 12:06:32,832 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.49/10.32 [2019-03-28 12:06:32,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:32,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.49/10.32 [2019-03-28 12:06:32,832 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.49/10.32 [2019-03-28 12:06:32,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 22.49/10.32 [2019-03-28 12:06:32,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.49/10.32 [2019-03-28 12:06:32,833 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.49/10.32 [2019-03-28 12:06:32,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:32,894 INFO L300 LassoAnalysis]: Preprocessing complete. 22.49/10.32 [2019-03-28 12:06:32,900 INFO L497 LassoAnalysis]: Using template 'affine'. 22.49/10.32 [2019-03-28 12:06:32,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:32,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:32,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:32,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:32,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:32,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:32,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:32,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:32,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.49/10.32 [2019-03-28 12:06:32,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:32,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:32,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:32,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:32,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:32,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:32,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:32,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:32,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.49/10.32 [2019-03-28 12:06:32,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:32,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:32,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:32,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:32,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:32,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:32,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:32,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:32,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.49/10.32 [2019-03-28 12:06:32,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:32,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:32,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:32,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:32,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:32,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:32,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:32,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:32,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.49/10.32 [2019-03-28 12:06:32,932 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 22.49/10.32 [2019-03-28 12:06:32,932 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 22.49/10.32 [2019-03-28 12:06:32,935 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.49/10.32 [2019-03-28 12:06:32,935 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.49/10.32 [2019-03-28 12:06:32,935 INFO L518 LassoAnalysis]: Proved termination. 22.49/10.32 [2019-03-28 12:06:32,936 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.49/10.32 Ranking function f(rec2_#in~j) = 1*rec2_#in~j 22.49/10.32 Supporting invariants [] 22.49/10.32 [2019-03-28 12:06:32,937 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.49/10.32 [2019-03-28 12:06:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:32,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:32,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:33,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:33,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:33,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:33,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:33,268 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 22.49/10.32 [2019-03-28 12:06:33,268 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization 22.49/10.32 [2019-03-28 12:06:33,273 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates 22.49/10.32 [2019-03-28 12:06:33,275 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states. Second operand 7 states. 22.49/10.32 [2019-03-28 12:06:33,961 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states.. Second operand 7 states. Result 193 states and 255 transitions. Complement of second has 56 states. 22.49/10.32 [2019-03-28 12:06:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states 22.49/10.32 [2019-03-28 12:06:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 22.49/10.32 [2019-03-28 12:06:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. 22.49/10.32 [2019-03-28 12:06:33,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 2 letters. Loop has 8 letters. 22.49/10.32 [2019-03-28 12:06:33,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:33,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 10 letters. Loop has 8 letters. 22.49/10.32 [2019-03-28 12:06:33,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:33,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 2 letters. Loop has 16 letters. 22.49/10.32 [2019-03-28 12:06:33,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:33,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 255 transitions. 22.49/10.32 [2019-03-28 12:06:34,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:34,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 40 states and 58 transitions. 22.49/10.32 [2019-03-28 12:06:34,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 22.49/10.32 [2019-03-28 12:06:34,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 22.49/10.32 [2019-03-28 12:06:34,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. 22.49/10.32 [2019-03-28 12:06:34,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.49/10.32 [2019-03-28 12:06:34,013 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. 22.49/10.32 [2019-03-28 12:06:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. 22.49/10.32 [2019-03-28 12:06:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. 22.49/10.32 [2019-03-28 12:06:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 22.49/10.32 [2019-03-28 12:06:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. 22.49/10.32 [2019-03-28 12:06:34,049 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. 22.49/10.32 [2019-03-28 12:06:34,049 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. 22.49/10.32 [2019-03-28 12:06:34,049 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 22.49/10.32 [2019-03-28 12:06:34,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. 22.49/10.32 [2019-03-28 12:06:34,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:34,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:34,051 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:34,052 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 22.49/10.32 [2019-03-28 12:06:34,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:34,053 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 373#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 370#rec2ENTRY 22.49/10.32 [2019-03-28 12:06:34,054 INFO L796 eck$LassoCheckResult]: Loop: 370#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 372#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 387#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 388#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 391#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 375#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 380#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 377#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 385#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 390#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 389#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 371#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 370#rec2ENTRY 22.49/10.32 [2019-03-28 12:06:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 2 times 22.49/10.32 [2019-03-28 12:06:34,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:34,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash -129367784, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:34,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash -287187007, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:34,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,345 INFO L216 LassoAnalysis]: Preferences: 22.49/10.32 [2019-03-28 12:06:34,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.49/10.32 [2019-03-28 12:06:34,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.49/10.32 [2019-03-28 12:06:34,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.49/10.32 [2019-03-28 12:06:34,345 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.49/10.32 [2019-03-28 12:06:34,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:34,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.49/10.32 [2019-03-28 12:06:34,346 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.49/10.32 [2019-03-28 12:06:34,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 22.49/10.32 [2019-03-28 12:06:34,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.49/10.32 [2019-03-28 12:06:34,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.49/10.32 [2019-03-28 12:06:34,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,381 INFO L300 LassoAnalysis]: Preprocessing complete. 22.49/10.32 [2019-03-28 12:06:34,381 INFO L412 LassoAnalysis]: Checking for nontermination... 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:34,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:34,384 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:34,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:34,415 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:34,419 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.49/10.32 [2019-03-28 12:06:34,443 INFO L216 LassoAnalysis]: Preferences: 22.49/10.32 [2019-03-28 12:06:34,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.49/10.32 [2019-03-28 12:06:34,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.49/10.32 [2019-03-28 12:06:34,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.49/10.32 [2019-03-28 12:06:34,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.49/10.32 [2019-03-28 12:06:34,444 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:34,444 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.49/10.32 [2019-03-28 12:06:34,444 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.49/10.32 [2019-03-28 12:06:34,444 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 22.49/10.32 [2019-03-28 12:06:34,444 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.49/10.32 [2019-03-28 12:06:34,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.49/10.32 [2019-03-28 12:06:34,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:34,478 INFO L300 LassoAnalysis]: Preprocessing complete. 22.49/10.32 [2019-03-28 12:06:34,479 INFO L497 LassoAnalysis]: Using template 'affine'. 22.49/10.32 [2019-03-28 12:06:34,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:34,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:34,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:34,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:34,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:34,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:34,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:34,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:34,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.49/10.32 [2019-03-28 12:06:34,490 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 22.49/10.32 [2019-03-28 12:06:34,490 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 22.49/10.32 [2019-03-28 12:06:34,491 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.49/10.32 [2019-03-28 12:06:34,491 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.49/10.32 [2019-03-28 12:06:34,491 INFO L518 LassoAnalysis]: Proved termination. 22.49/10.32 [2019-03-28 12:06:34,491 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.49/10.32 Ranking function f(rec2_#in~j) = 1*rec2_#in~j 22.49/10.32 Supporting invariants [] 22.49/10.32 [2019-03-28 12:06:34,491 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.49/10.32 [2019-03-28 12:06:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:34,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:34,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:34,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:34,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,765 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 22.49/10.32 [2019-03-28 12:06:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:34,794 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 22.49/10.32 [2019-03-28 12:06:34,794 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 22.49/10.32 [2019-03-28 12:06:34,794 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 10 loop predicates 22.49/10.32 [2019-03-28 12:06:34,795 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 10 states. 22.49/10.32 [2019-03-28 12:06:35,481 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 145 states and 219 transitions. Complement of second has 72 states. 22.49/10.32 [2019-03-28 12:06:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states 22.49/10.32 [2019-03-28 12:06:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 22.49/10.32 [2019-03-28 12:06:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. 22.49/10.32 [2019-03-28 12:06:35,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 2 letters. Loop has 24 letters. 22.49/10.32 [2019-03-28 12:06:35,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:35,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 26 letters. Loop has 24 letters. 22.49/10.32 [2019-03-28 12:06:35,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:35,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 2 letters. Loop has 48 letters. 22.49/10.32 [2019-03-28 12:06:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:35,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 219 transitions. 22.49/10.32 [2019-03-28 12:06:35,497 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 22.49/10.32 [2019-03-28 12:06:35,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 134 states and 208 transitions. 22.49/10.32 [2019-03-28 12:06:35,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 22.49/10.32 [2019-03-28 12:06:35,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 22.49/10.32 [2019-03-28 12:06:35,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 208 transitions. 22.49/10.32 [2019-03-28 12:06:35,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:35,505 INFO L706 BuchiCegarLoop]: Abstraction has 134 states and 208 transitions. 22.49/10.32 [2019-03-28 12:06:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 208 transitions. 22.49/10.32 [2019-03-28 12:06:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 52. 22.49/10.32 [2019-03-28 12:06:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 22.49/10.32 [2019-03-28 12:06:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. 22.49/10.32 [2019-03-28 12:06:35,520 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. 22.49/10.32 [2019-03-28 12:06:35,520 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. 22.49/10.32 [2019-03-28 12:06:35,520 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 22.49/10.32 [2019-03-28 12:06:35,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. 22.49/10.32 [2019-03-28 12:06:35,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:35,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:35,522 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:35,524 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.49/10.32 [2019-03-28 12:06:35,524 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:35,524 INFO L794 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 783#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 787#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 748#L18 22.49/10.32 [2019-03-28 12:06:35,525 INFO L796 eck$LassoCheckResult]: Loop: 748#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 772#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 784#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 777#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 757#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 754#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 755#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 758#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 756#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 753#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 774#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 775#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 791#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 790#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 789#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 779#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 747#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 746#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 748#L18 22.49/10.32 [2019-03-28 12:06:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:35,526 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:35,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:35,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:35,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1000338971, now seen corresponding path program 2 times 22.49/10.32 [2019-03-28 12:06:35,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:35,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.49/10.32 [2019-03-28 12:06:35,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.49/10.32 [2019-03-28 12:06:35,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 22.49/10.32 [2019-03-28 12:06:35,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 22.49/10.32 [2019-03-28 12:06:35,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:35,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:35,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:35,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.49/10.32 [2019-03-28 12:06:35,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 22.49/10.32 [2019-03-28 12:06:35,681 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.49/10.32 [2019-03-28 12:06:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 22.49/10.32 [2019-03-28 12:06:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 22.49/10.32 [2019-03-28 12:06:35,686 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. cyclomatic complexity: 27 Second operand 6 states. 22.49/10.32 [2019-03-28 12:06:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.49/10.32 [2019-03-28 12:06:35,784 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. 22.49/10.32 [2019-03-28 12:06:35,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 22.49/10.32 [2019-03-28 12:06:35,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 85 transitions. 22.49/10.32 [2019-03-28 12:06:35,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 22.49/10.32 [2019-03-28 12:06:35,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 85 transitions. 22.49/10.32 [2019-03-28 12:06:35,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 22.49/10.32 [2019-03-28 12:06:35,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 22.49/10.32 [2019-03-28 12:06:35,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. 22.49/10.32 [2019-03-28 12:06:35,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:35,793 INFO L706 BuchiCegarLoop]: Abstraction has 59 states and 85 transitions. 22.49/10.32 [2019-03-28 12:06:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. 22.49/10.32 [2019-03-28 12:06:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. 22.49/10.32 [2019-03-28 12:06:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 22.49/10.32 [2019-03-28 12:06:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. 22.49/10.32 [2019-03-28 12:06:35,800 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. 22.49/10.32 [2019-03-28 12:06:35,800 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. 22.49/10.32 [2019-03-28 12:06:35,800 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 22.49/10.32 [2019-03-28 12:06:35,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. 22.49/10.32 [2019-03-28 12:06:35,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 22.49/10.32 [2019-03-28 12:06:35,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:35,802 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:35,804 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.49/10.32 [2019-03-28 12:06:35,804 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 7, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:35,804 INFO L794 eck$LassoCheckResult]: Stem: 1028#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1029#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1032#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 992#L18 22.49/10.32 [2019-03-28 12:06:35,805 INFO L796 eck$LassoCheckResult]: Loop: 992#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1025#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1031#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1043#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 998#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 997#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1003#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1002#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1004#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1022#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1009#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1010#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 999#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1003#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1002#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1004#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1022#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1009#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1010#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1041#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1039#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1036#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 991#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 990#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 992#L18 22.49/10.32 [2019-03-28 12:06:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:35,806 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 2 times 22.49/10.32 [2019-03-28 12:06:35,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:35,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1577716842, now seen corresponding path program 3 times 22.49/10.32 [2019-03-28 12:06:35,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:35,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:35,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.49/10.32 [2019-03-28 12:06:35,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.49/10.32 [2019-03-28 12:06:35,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 22.49/10.32 [2019-03-28 12:06:35,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) 22.49/10.32 [2019-03-28 12:06:35,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:35,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:35,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 115 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:35,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.49/10.32 [2019-03-28 12:06:35,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 22.49/10.32 [2019-03-28 12:06:35,983 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.49/10.32 [2019-03-28 12:06:35,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 22.49/10.32 [2019-03-28 12:06:35,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 22.49/10.32 [2019-03-28 12:06:35,983 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. cyclomatic complexity: 30 Second operand 6 states. 22.49/10.32 [2019-03-28 12:06:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.49/10.32 [2019-03-28 12:06:36,083 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. 22.49/10.32 [2019-03-28 12:06:36,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 22.49/10.32 [2019-03-28 12:06:36,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 100 transitions. 22.49/10.32 [2019-03-28 12:06:36,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 22.49/10.32 [2019-03-28 12:06:36,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 100 transitions. 22.49/10.32 [2019-03-28 12:06:36,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 22.49/10.32 [2019-03-28 12:06:36,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 22.49/10.32 [2019-03-28 12:06:36,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 100 transitions. 22.49/10.32 [2019-03-28 12:06:36,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:36,091 INFO L706 BuchiCegarLoop]: Abstraction has 67 states and 100 transitions. 22.49/10.32 [2019-03-28 12:06:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 100 transitions. 22.49/10.32 [2019-03-28 12:06:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. 22.49/10.32 [2019-03-28 12:06:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 22.49/10.32 [2019-03-28 12:06:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. 22.49/10.32 [2019-03-28 12:06:36,099 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. 22.49/10.32 [2019-03-28 12:06:36,099 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. 22.49/10.32 [2019-03-28 12:06:36,099 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 22.49/10.32 [2019-03-28 12:06:36,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 90 transitions. 22.49/10.32 [2019-03-28 12:06:36,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 22.49/10.32 [2019-03-28 12:06:36,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:36,100 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:36,102 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,102 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,103 INFO L794 eck$LassoCheckResult]: Stem: 1335#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1336#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1340#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1295#L18 22.49/10.32 [2019-03-28 12:06:36,104 INFO L796 eck$LassoCheckResult]: Loop: 1295#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1333#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1338#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1352#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1300#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1306#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1305#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1307#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1329#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1330#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1351#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1302#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1306#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1305#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1307#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1329#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1330#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1351#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1308#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1306#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1305#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1307#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1329#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1330#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1351#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1350#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1349#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1347#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 1294#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 1293#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1295#L18 22.49/10.32 [2019-03-28 12:06:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 3 times 22.49/10.32 [2019-03-28 12:06:36,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash -865815173, now seen corresponding path program 4 times 22.49/10.32 [2019-03-28 12:06:36,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 57 proven. 58 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:36,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.49/10.32 [2019-03-28 12:06:36,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.49/10.32 [2019-03-28 12:06:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 22.49/10.32 [2019-03-28 12:06:36,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 22.49/10.32 [2019-03-28 12:06:36,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:36,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 194 proven. 23 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:36,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.49/10.32 [2019-03-28 12:06:36,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 22.49/10.32 [2019-03-28 12:06:36,285 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.49/10.32 [2019-03-28 12:06:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 22.49/10.32 [2019-03-28 12:06:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 22.49/10.32 [2019-03-28 12:06:36,286 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. cyclomatic complexity: 34 Second operand 8 states. 22.49/10.32 [2019-03-28 12:06:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.49/10.32 [2019-03-28 12:06:36,380 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. 22.49/10.32 [2019-03-28 12:06:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 22.49/10.32 [2019-03-28 12:06:36,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. 22.49/10.32 [2019-03-28 12:06:36,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 22.49/10.32 [2019-03-28 12:06:36,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 65 transitions. 22.49/10.32 [2019-03-28 12:06:36,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 22.49/10.32 [2019-03-28 12:06:36,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 22.49/10.32 [2019-03-28 12:06:36,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 65 transitions. 22.49/10.32 [2019-03-28 12:06:36,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:36,387 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 65 transitions. 22.49/10.32 [2019-03-28 12:06:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 65 transitions. 22.49/10.32 [2019-03-28 12:06:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. 22.49/10.32 [2019-03-28 12:06:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 22.49/10.32 [2019-03-28 12:06:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. 22.49/10.32 [2019-03-28 12:06:36,392 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. 22.49/10.32 [2019-03-28 12:06:36,392 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. 22.49/10.32 [2019-03-28 12:06:36,392 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 22.49/10.32 [2019-03-28 12:06:36,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. 22.49/10.32 [2019-03-28 12:06:36,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 22.49/10.32 [2019-03-28 12:06:36,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:36,393 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:36,394 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,394 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,394 INFO L794 eck$LassoCheckResult]: Stem: 1665#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1634#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1633#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1636#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1640#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1639#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1641#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1649#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1661#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:36,394 INFO L796 eck$LassoCheckResult]: Loop: 1661#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1668#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1646#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1661#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:36,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash 69333, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:36,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1667358318, now seen corresponding path program 2 times 22.49/10.32 [2019-03-28 12:06:36,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,441 INFO L216 LassoAnalysis]: Preferences: 22.49/10.32 [2019-03-28 12:06:36,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.49/10.32 [2019-03-28 12:06:36,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.49/10.32 [2019-03-28 12:06:36,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.49/10.32 [2019-03-28 12:06:36,442 INFO L127 ssoRankerPreferences]: Use exernal solver: true 22.49/10.32 [2019-03-28 12:06:36,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:36,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.49/10.32 [2019-03-28 12:06:36,442 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.49/10.32 [2019-03-28 12:06:36,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 22.49/10.32 [2019-03-28 12:06:36,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.49/10.32 [2019-03-28 12:06:36,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.49/10.32 [2019-03-28 12:06:36,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,479 INFO L300 LassoAnalysis]: Preprocessing complete. 22.49/10.32 [2019-03-28 12:06:36,480 INFO L412 LassoAnalysis]: Checking for nontermination... 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:36,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:36,485 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:36,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. 22.49/10.32 [2019-03-28 12:06:36,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:36,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:36,516 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:36,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 22.49/10.32 [2019-03-28 12:06:36,546 INFO L163 nArgumentSynthesizer]: Using integer mode. 22.49/10.32 [2019-03-28 12:06:36,574 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 22.49/10.32 [2019-03-28 12:06:36,576 INFO L216 LassoAnalysis]: Preferences: 22.49/10.32 [2019-03-28 12:06:36,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.49/10.32 [2019-03-28 12:06:36,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.49/10.32 [2019-03-28 12:06:36,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.49/10.32 [2019-03-28 12:06:36,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.49/10.32 [2019-03-28 12:06:36,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.49/10.32 [2019-03-28 12:06:36,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.49/10.32 [2019-03-28 12:06:36,577 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.49/10.32 [2019-03-28 12:06:36,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 22.49/10.32 [2019-03-28 12:06:36,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.49/10.32 [2019-03-28 12:06:36,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.49/10.32 [2019-03-28 12:06:36,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.49/10.32 [2019-03-28 12:06:36,611 INFO L300 LassoAnalysis]: Preprocessing complete. 22.49/10.32 [2019-03-28 12:06:36,611 INFO L497 LassoAnalysis]: Using template 'affine'. 22.49/10.32 [2019-03-28 12:06:36,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:36,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:36,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:36,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:36,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:36,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:36,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:36,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:36,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.49/10.32 [2019-03-28 12:06:36,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.49/10.32 Termination analysis: LINEAR_WITH_GUESSES 22.49/10.32 Number of strict supporting invariants: 0 22.49/10.32 Number of non-strict supporting invariants: 1 22.49/10.32 Consider only non-deceasing supporting invariants: true 22.49/10.32 Simplify termination arguments: true 22.49/10.32 Simplify supporting invariants: trueOverapproximate stem: false 22.49/10.32 [2019-03-28 12:06:36,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.49/10.32 [2019-03-28 12:06:36,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.49/10.32 [2019-03-28 12:06:36,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.49/10.32 [2019-03-28 12:06:36,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.49/10.32 [2019-03-28 12:06:36,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.49/10.32 [2019-03-28 12:06:36,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.49/10.32 [2019-03-28 12:06:36,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.49/10.32 [2019-03-28 12:06:36,620 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.49/10.32 [2019-03-28 12:06:36,621 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 22.49/10.32 [2019-03-28 12:06:36,621 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 22.49/10.32 [2019-03-28 12:06:36,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.49/10.32 [2019-03-28 12:06:36,622 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 22.49/10.32 [2019-03-28 12:06:36,622 INFO L518 LassoAnalysis]: Proved termination. 22.49/10.32 [2019-03-28 12:06:36,622 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.49/10.32 Ranking function f(rec1_#in~i) = 1*rec1_#in~i 22.49/10.32 Supporting invariants [] 22.49/10.32 [2019-03-28 12:06:36,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 22.49/10.32 [2019-03-28 12:06:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:36,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:36,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:36,695 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 22.49/10.32 [2019-03-28 12:06:36,695 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 22.49/10.32 [2019-03-28 12:06:36,695 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. 22.49/10.32 [2019-03-28 12:06:36,759 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 180 states and 213 transitions. Complement of second has 47 states. 22.49/10.32 [2019-03-28 12:06:36,759 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 22.49/10.32 [2019-03-28 12:06:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 22.49/10.32 [2019-03-28 12:06:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 22.49/10.32 [2019-03-28 12:06:36,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. 22.49/10.32 [2019-03-28 12:06:36,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:36,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. 22.49/10.32 [2019-03-28 12:06:36,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:36,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 6 letters. 22.49/10.32 [2019-03-28 12:06:36,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.49/10.32 [2019-03-28 12:06:36,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 213 transitions. 22.49/10.32 [2019-03-28 12:06:36,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 22.49/10.32 [2019-03-28 12:06:36,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 83 states and 113 transitions. 22.49/10.32 [2019-03-28 12:06:36,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 22.49/10.32 [2019-03-28 12:06:36,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 22.49/10.32 [2019-03-28 12:06:36,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 113 transitions. 22.49/10.32 [2019-03-28 12:06:36,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:36,770 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 113 transitions. 22.49/10.32 [2019-03-28 12:06:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 113 transitions. 22.49/10.32 [2019-03-28 12:06:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. 22.49/10.32 [2019-03-28 12:06:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. 22.49/10.32 [2019-03-28 12:06:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. 22.49/10.32 [2019-03-28 12:06:36,777 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. 22.49/10.32 [2019-03-28 12:06:36,777 INFO L609 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. 22.49/10.32 [2019-03-28 12:06:36,777 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 22.49/10.32 [2019-03-28 12:06:36,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 77 transitions. 22.49/10.32 [2019-03-28 12:06:36,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:36,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:36,778 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:36,779 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,779 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,779 INFO L794 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1958#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1957#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1960#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1981#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1994#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2012#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1964#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1963#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:36,780 INFO L796 eck$LassoCheckResult]: Loop: 1963#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1966#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1975#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1993#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2015#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2014#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1991#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1974#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1982#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1999#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1965#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1963#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 3 times 22.49/10.32 [2019-03-28 12:06:36,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1132960615, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:36,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.49/10.32 [2019-03-28 12:06:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 22.49/10.32 [2019-03-28 12:06:36,814 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.49/10.32 [2019-03-28 12:06:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 22.49/10.32 [2019-03-28 12:06:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 22.49/10.32 [2019-03-28 12:06:36,815 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. cyclomatic complexity: 19 Second operand 6 states. 22.49/10.32 [2019-03-28 12:06:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.49/10.32 [2019-03-28 12:06:36,855 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. 22.49/10.32 [2019-03-28 12:06:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 22.49/10.32 [2019-03-28 12:06:36,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 101 transitions. 22.49/10.32 [2019-03-28 12:06:36,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 22.49/10.32 [2019-03-28 12:06:36,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 101 transitions. 22.49/10.32 [2019-03-28 12:06:36,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 22.49/10.32 [2019-03-28 12:06:36,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 22.49/10.32 [2019-03-28 12:06:36,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 101 transitions. 22.49/10.32 [2019-03-28 12:06:36,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:36,862 INFO L706 BuchiCegarLoop]: Abstraction has 80 states and 101 transitions. 22.49/10.32 [2019-03-28 12:06:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 101 transitions. 22.49/10.32 [2019-03-28 12:06:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. 22.49/10.32 [2019-03-28 12:06:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. 22.49/10.32 [2019-03-28 12:06:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. 22.49/10.32 [2019-03-28 12:06:36,868 INFO L729 BuchiCegarLoop]: Abstraction has 73 states and 91 transitions. 22.49/10.32 [2019-03-28 12:06:36,868 INFO L609 BuchiCegarLoop]: Abstraction has 73 states and 91 transitions. 22.49/10.32 [2019-03-28 12:06:36,868 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 22.49/10.32 [2019-03-28 12:06:36,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 91 transitions. 22.49/10.32 [2019-03-28 12:06:36,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 22.49/10.32 [2019-03-28 12:06:36,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:36,869 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:36,870 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,870 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:36,871 INFO L794 eck$LassoCheckResult]: Stem: 2149#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 2112#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 2111#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 2114#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 2145#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 2152#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2156#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2132#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2150#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:36,871 INFO L796 eck$LassoCheckResult]: Loop: 2150#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2167#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2125#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2165#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2167#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2125#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2165#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2143#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2124#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2126#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2118#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2117#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2172#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2171#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 2134#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 2146#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2159#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2158#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2157#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 2138#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 2139#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2164#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2131#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2146#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2159#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2130#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2150#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 4 times 22.49/10.32 [2019-03-28 12:06:36,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash -561081304, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:36,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:36,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:36,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.49/10.32 [2019-03-28 12:06:36,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.49/10.32 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.49/10.32 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.49/10.32 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.49/10.32 [2019-03-28 12:06:36,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.32 [2019-03-28 12:06:36,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core 22.49/10.32 [2019-03-28 12:06:36,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.49/10.32 [2019-03-28 12:06:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. 22.49/10.32 [2019-03-28 12:06:36,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.49/10.32 [2019-03-28 12:06:36,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 22.49/10.32 [2019-03-28 12:06:36,989 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.49/10.32 [2019-03-28 12:06:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 22.49/10.32 [2019-03-28 12:06:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 22.49/10.32 [2019-03-28 12:06:36,989 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. cyclomatic complexity: 21 Second operand 8 states. 22.49/10.32 [2019-03-28 12:06:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.49/10.32 [2019-03-28 12:06:37,056 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. 22.49/10.32 [2019-03-28 12:06:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 22.49/10.32 [2019-03-28 12:06:37,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 97 transitions. 22.49/10.32 [2019-03-28 12:06:37,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 22.49/10.32 [2019-03-28 12:06:37,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 97 transitions. 22.49/10.32 [2019-03-28 12:06:37,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 22.49/10.32 [2019-03-28 12:06:37,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 22.49/10.32 [2019-03-28 12:06:37,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 97 transitions. 22.49/10.32 [2019-03-28 12:06:37,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.49/10.32 [2019-03-28 12:06:37,062 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 97 transitions. 22.49/10.32 [2019-03-28 12:06:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 97 transitions. 22.49/10.32 [2019-03-28 12:06:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. 22.49/10.32 [2019-03-28 12:06:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. 22.49/10.32 [2019-03-28 12:06:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. 22.49/10.32 [2019-03-28 12:06:37,068 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. 22.49/10.32 [2019-03-28 12:06:37,069 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. 22.49/10.32 [2019-03-28 12:06:37,069 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 22.49/10.32 [2019-03-28 12:06:37,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. 22.49/10.32 [2019-03-28 12:06:37,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 22.49/10.32 [2019-03-28 12:06:37,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.49/10.32 [2019-03-28 12:06:37,070 INFO L119 BuchiIsEmpty]: Starting construction of run 22.49/10.32 [2019-03-28 12:06:37,070 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:37,071 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 1, 1, 1, 1] 22.49/10.32 [2019-03-28 12:06:37,071 INFO L794 eck$LassoCheckResult]: Stem: 2400#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 2363#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 2362#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 2365#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 2386#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 2403#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2415#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2379#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2401#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:37,071 INFO L796 eck$LassoCheckResult]: Loop: 2401#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2422#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2377#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2420#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2421#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2419#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2398#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2369#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2368#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2371#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2424#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2406#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 2381#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 2395#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2409#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2378#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2401#rec1ENTRY 22.49/10.32 [2019-03-28 12:06:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 5 times 22.49/10.32 [2019-03-28 12:06:37,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:37,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.49/10.32 [2019-03-28 12:06:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.49/10.32 [2019-03-28 12:06:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1762080644, now seen corresponding path program 1 times 22.49/10.32 [2019-03-28 12:06:37,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.49/10.32 [2019-03-28 12:06:37,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.49/10.32 [2019-03-28 12:06:37,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:37,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.49/10.32 [2019-03-28 12:06:37,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.49/10.33 [2019-03-28 12:06:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.49/10.33 [2019-03-28 12:06:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 22.49/10.33 [2019-03-28 12:06:37,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.49/10.33 [2019-03-28 12:06:37,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 22.49/10.33 [2019-03-28 12:06:37,114 INFO L811 eck$LassoCheckResult]: loop already infeasible 22.49/10.33 [2019-03-28 12:06:37,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 22.49/10.33 [2019-03-28 12:06:37,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 22.49/10.33 [2019-03-28 12:06:37,114 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 17 Second operand 6 states. 22.49/10.33 [2019-03-28 12:06:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.49/10.33 [2019-03-28 12:06:37,159 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. 22.49/10.33 [2019-03-28 12:06:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 22.49/10.33 [2019-03-28 12:06:37,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 79 transitions. 22.49/10.33 [2019-03-28 12:06:37,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.49/10.33 [2019-03-28 12:06:37,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. 22.49/10.33 [2019-03-28 12:06:37,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 22.49/10.33 [2019-03-28 12:06:37,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 22.49/10.33 [2019-03-28 12:06:37,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 22.49/10.33 [2019-03-28 12:06:37,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.49/10.33 [2019-03-28 12:06:37,163 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.49/10.33 [2019-03-28 12:06:37,163 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.49/10.33 [2019-03-28 12:06:37,163 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.49/10.33 [2019-03-28 12:06:37,163 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 22.49/10.33 [2019-03-28 12:06:37,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 22.49/10.33 [2019-03-28 12:06:37,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.49/10.33 [2019-03-28 12:06:37,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 22.49/10.33 [2019-03-28 12:06:37,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:06:37 BasicIcfg 22.49/10.33 [2019-03-28 12:06:37,170 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 22.49/10.33 [2019-03-28 12:06:37,170 INFO L168 Benchmark]: Toolchain (without parser) took 5815.05 ms. Allocated memory was 649.6 MB in the beginning and 773.3 MB in the end (delta: 123.7 MB). Free memory was 558.4 MB in the beginning and 509.1 MB in the end (delta: 49.3 MB). Peak memory consumption was 173.0 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,172 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.94 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 558.4 MB in the beginning and 640.6 MB in the end (delta: -82.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.71 ms. Allocated memory is still 673.2 MB. Free memory was 640.6 MB in the beginning and 637.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,174 INFO L168 Benchmark]: Boogie Preprocessor took 21.04 ms. Allocated memory is still 673.2 MB. Free memory was 637.5 MB in the beginning and 636.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,174 INFO L168 Benchmark]: RCFGBuilder took 223.22 ms. Allocated memory is still 673.2 MB. Free memory was 636.2 MB in the beginning and 621.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,175 INFO L168 Benchmark]: BlockEncodingV2 took 76.06 ms. Allocated memory is still 673.2 MB. Free memory was 621.8 MB in the beginning and 616.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,175 INFO L168 Benchmark]: TraceAbstraction took 186.08 ms. Allocated memory is still 673.2 MB. Free memory was 615.3 MB in the beginning and 603.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,176 INFO L168 Benchmark]: BuchiAutomizer took 4975.60 ms. Allocated memory was 673.2 MB in the beginning and 773.3 MB in the end (delta: 100.1 MB). Free memory was 603.2 MB in the beginning and 509.1 MB in the end (delta: 94.1 MB). Peak memory consumption was 194.3 MB. Max. memory is 50.3 GB. 22.49/10.33 [2019-03-28 12:06:37,180 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 22.49/10.33 --- Results --- 22.49/10.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 22.49/10.33 - StatisticsResult: Initial Icfg 22.49/10.33 21 locations, 26 edges 22.49/10.33 - StatisticsResult: Encoded RCFG 22.49/10.33 17 locations, 22 edges 22.49/10.33 * Results from de.uni_freiburg.informatik.ultimate.core: 22.49/10.33 - StatisticsResult: Toolchain Benchmarks 22.49/10.33 Benchmark results are: 22.49/10.33 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 22.49/10.33 * CACSL2BoogieTranslator took 290.94 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 558.4 MB in the beginning and 640.6 MB in the end (delta: -82.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 22.49/10.33 * Boogie Procedure Inliner took 36.71 ms. Allocated memory is still 673.2 MB. Free memory was 640.6 MB in the beginning and 637.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 22.49/10.33 * Boogie Preprocessor took 21.04 ms. Allocated memory is still 673.2 MB. Free memory was 637.5 MB in the beginning and 636.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 22.49/10.33 * RCFGBuilder took 223.22 ms. Allocated memory is still 673.2 MB. Free memory was 636.2 MB in the beginning and 621.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 50.3 GB. 22.49/10.33 * BlockEncodingV2 took 76.06 ms. Allocated memory is still 673.2 MB. Free memory was 621.8 MB in the beginning and 616.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 22.49/10.33 * TraceAbstraction took 186.08 ms. Allocated memory is still 673.2 MB. Free memory was 615.3 MB in the beginning and 603.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 22.49/10.33 * BuchiAutomizer took 4975.60 ms. Allocated memory was 673.2 MB in the beginning and 773.3 MB in the end (delta: 100.1 MB). Free memory was 603.2 MB in the beginning and 509.1 MB in the end (delta: 94.1 MB). Peak memory consumption was 194.3 MB. Max. memory is 50.3 GB. 22.49/10.33 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 22.49/10.33 - AllSpecificationsHoldResult: All specifications hold 22.49/10.33 We were not able to verify any specifiation because the program does not contain any specification. 22.49/10.33 - StatisticsResult: Ultimate Automizer benchmark data 22.49/10.33 CFG has 3 procedures, 17 locations, 0 error locations. SAFE Result, 0.1s 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=17occurred 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, 8 LocationsWithAnnotation, 23 PreInvPairs, 23 NumberOfFragments, 8 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 22.49/10.33 - StatisticsResult: Constructed decomposition of program 22.49/10.33 Your program was decomposed into 9 terminating modules (6 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 15 locations. One nondeterministic module has affine ranking function \old(j) and consists of 18 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. 22.49/10.33 - StatisticsResult: Timing statistics 22.49/10.33 BüchiAutomizer plugin needed 4.9s and 10 iterations. TraceHistogramMax:13. Analysis of lassos took 2.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 155 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 19/24 HoareTripleCheckerStatistics: 175 SDtfs, 175 SDslu, 478 SDs, 0 SdLazy, 724 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 22.49/10.33 - TerminationAnalysisResult: Termination proven 22.49/10.33 Buchi Automizer proved that your program is terminating 22.49/10.33 RESULT: Ultimate proved your program to be correct! 22.49/10.33 !SESSION 2019-03-28 12:06:28.066 ----------------------------------------------- 22.49/10.33 eclipse.buildId=unknown 22.49/10.33 java.version=1.8.0_181 22.49/10.33 java.vendor=Oracle Corporation 22.49/10.33 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 22.49/10.33 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 22.49/10.33 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 22.49/10.33 22.49/10.33 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:06:37.413 22.49/10.33 !MESSAGE The workspace will exit with unsaved changes in this session. 22.49/10.33 Received shutdown request... 22.49/10.33 Ultimate: 22.49/10.33 GTK+ Version Check 22.49/10.33 EOF