NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:02:09,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:02:09,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:02:09,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:02:09,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:02:09,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:02:09,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:02:09,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:02:09,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:02:09,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:02:09,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:02:09,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:02:09,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:02:09,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:02:09,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:02:09,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:02:09,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:02:09,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:02:09,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:02:09,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:02:09,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:02:09,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:02:09,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:02:09,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:02:09,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:02:09,193 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:02:09,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:02:09,194 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:02:09,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:02:09,195 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:02:09,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:02:09,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:02:09,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:02:09,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:02:09,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:02:09,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:02:09,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:02:09,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:02:09,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:02:09,200 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 05:02:09,214 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:02:09,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:02:09,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:02:09,216 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:02:09,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:02:09,216 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:02:09,217 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:02:09,217 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:02:09,217 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:02:09,217 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:02:09,217 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:02:09,217 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:02:09,218 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:02:09,218 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:02:09,218 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:09,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:02:09,218 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:02:09,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:02:09,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:02:09,219 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:02:09,219 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:02:09,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:02:09,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:02:09,220 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:02:09,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:02:09,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:02:09,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:02:09,220 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:02:09,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:02:09,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:02:09,258 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:02:09,262 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:02:09,263 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:02:09,263 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:02:09,264 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:02:09,376 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/29a53aff2f434e559b9149fa90dfbb2e/FLAG29bd977e4 [2020-06-22 05:02:09,703 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:02:09,704 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:02:09,710 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/29a53aff2f434e559b9149fa90dfbb2e/FLAG29bd977e4 [2020-06-22 05:02:10,115 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/29a53aff2f434e559b9149fa90dfbb2e [2020-06-22 05:02:10,126 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:02:10,128 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:02:10,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:02:10,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:02:10,132 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:02:10,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:02:10,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:02:10,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:02:10,324 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:02:10,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:02:10,409 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:02:10,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10 WrapperNode [2020-06-22 05:02:10,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:02:10,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:02:10,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:02:10,412 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:02:10,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:02:10,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:02:10,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:02:10,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:02:10,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:02:10,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:02:10,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:02:10,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:02:10,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:02:10,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:02:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:02:10,660 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:02:10,660 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 05:02:10,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:02:10 BoogieIcfgContainer [2020-06-22 05:02:10,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:02:10,662 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:02:10,662 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:02:10,664 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:02:10,665 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:02:10" (1/1) ... [2020-06-22 05:02:10,679 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-06-22 05:02:10,680 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:02:10,681 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:02:10,682 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:02:10,682 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:02:10,684 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:02:10,685 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:02:10,685 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:02:10,701 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:02:10,717 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 05:02:10,722 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 05:02:10,723 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:02:10,734 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:02:10,736 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 05:02:10,737 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:02:10,737 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:02:10,738 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:02:10,738 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:02:10,738 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-06-22 05:02:10,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:02:10 BasicIcfg [2020-06-22 05:02:10,739 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:02:10,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:02:10,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:02:10,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:02:10,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:02:10" (1/4) ... [2020-06-22 05:02:10,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d947e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (2/4) ... [2020-06-22 05:02:10,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d947e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:02:10" (3/4) ... [2020-06-22 05:02:10,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d947e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:02:10" (4/4) ... [2020-06-22 05:02:10,747 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:02:10,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:02:10,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:02:10,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:02:10,808 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:02:10,809 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:02:10,809 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:02:10,810 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:02:10,810 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:02:10,810 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:02:10,810 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:02:10,810 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:02:10,810 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:02:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 05:02:10,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:02:10,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 05:02:10,881 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 11 23) the Hoare annotation is: true [2020-06-22 05:02:10,881 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 11 23) no Hoare annotation was computed. [2020-06-22 05:02:10,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:02:10,882 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 05:02:10,882 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 23) no Hoare annotation was computed. [2020-06-22 05:02:10,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:02:10 BasicIcfg [2020-06-22 05:02:10,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:02:10,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:02:10,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:02:10,894 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:02:10,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:02:10,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:02:10" (1/5) ... [2020-06-22 05:02:10,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60cf61d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:02:10,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:02:10" (2/5) ... [2020-06-22 05:02:10,897 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60cf61d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,898 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:02:10,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:02:10" (3/5) ... [2020-06-22 05:02:10,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60cf61d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,898 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:02:10,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:02:10" (4/5) ... [2020-06-22 05:02:10,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60cf61d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:02:10, skipping insertion in model container [2020-06-22 05:02:10,899 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:02:10,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:02:10" (5/5) ... [2020-06-22 05:02:10,901 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:02:10,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:02:10,928 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:02:10,928 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:02:10,929 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:02:10,929 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:02:10,929 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:02:10,929 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:02:10,929 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:02:10,930 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:02:10,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 05:02:10,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:02:10,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:10,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:10,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 05:02:10,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:02:10,959 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:02:10,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 05:02:10,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:02:10,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:10,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:10,960 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 05:02:10,960 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:02:10,966 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5#L18-1true [2020-06-22 05:02:10,966 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6#L12true [55] L12-->L12-2: Formula: (< 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3#L12-2true [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 7#L15-1true [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L18-1true [2020-06-22 05:02:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-06-22 05:02:10,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:11,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2198982, now seen corresponding path program 1 times [2020-06-22 05:02:11,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:11,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:02:11,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:02:11,097 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:11,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:02:11,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:02:11,113 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2020-06-22 05:02:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:11,148 INFO L93 Difference]: Finished difference Result 6 states and 11 transitions. [2020-06-22 05:02:11,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:02:11,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 11 transitions. [2020-06-22 05:02:11,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:02:11,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 11 transitions. [2020-06-22 05:02:11,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 05:02:11,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 05:02:11,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 11 transitions. [2020-06-22 05:02:11,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:02:11,160 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 11 transitions. [2020-06-22 05:02:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 11 transitions. [2020-06-22 05:02:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. [2020-06-22 05:02:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:02:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-06-22 05:02:11,188 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. [2020-06-22 05:02:11,188 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 10 transitions. [2020-06-22 05:02:11,188 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:02:11,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 10 transitions. [2020-06-22 05:02:11,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:02:11,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:11,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:11,190 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 05:02:11,190 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:02:11,190 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 23#L18-1 [2020-06-22 05:02:11,191 INFO L796 eck$LassoCheckResult]: Loop: 23#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 24#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 21#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 23#L18-1 [2020-06-22 05:02:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2020-06-22 05:02:11,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2199943, now seen corresponding path program 1 times [2020-06-22 05:02:11,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:11,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:02:11,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:02:11,220 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:11,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:02:11,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:02:11,221 INFO L87 Difference]: Start difference. First operand 5 states and 10 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-06-22 05:02:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:11,262 INFO L93 Difference]: Finished difference Result 9 states and 18 transitions. [2020-06-22 05:02:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:02:11,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 18 transitions. [2020-06-22 05:02:11,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:02:11,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 18 transitions. [2020-06-22 05:02:11,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 05:02:11,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 05:02:11,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 18 transitions. [2020-06-22 05:02:11,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:02:11,266 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. [2020-06-22 05:02:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 18 transitions. [2020-06-22 05:02:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 05:02:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 05:02:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2020-06-22 05:02:11,269 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. [2020-06-22 05:02:11,269 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. [2020-06-22 05:02:11,269 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:02:11,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 18 transitions. [2020-06-22 05:02:11,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:02:11,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:11,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:11,270 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 05:02:11,270 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:02:11,271 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 44#L18-1 [2020-06-22 05:02:11,271 INFO L796 eck$LassoCheckResult]: Loop: 44#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 45#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 40#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 42#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 44#L18-1 [2020-06-22 05:02:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2020-06-22 05:02:11,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2200594, now seen corresponding path program 1 times [2020-06-22 05:02:11,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:11,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 65000022, now seen corresponding path program 1 times [2020-06-22 05:02:11,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:11,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:11,348 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:11,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:11,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:11,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:11,349 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:11,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:11,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:11,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:11,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:02:11,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:11,350 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:11,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,467 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:11,468 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:11,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:11,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:11,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:11,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:11,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:11,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:11,544 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:11,545 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:11,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:11,555 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:11,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:11,582 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:11,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:11,587 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:11,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:11,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:11,622 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:11,646 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:11,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:11,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:11,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:11,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:11,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:11,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:11,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:11,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:02:11,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:11,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:11,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:11,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:11,733 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:11,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:11,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:11,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:11,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:11,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:11,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:11,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:11,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:11,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:11,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:11,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:11,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:11,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:11,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:11,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:11,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:11,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:11,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:11,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:11,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:11,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:11,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:11,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:11,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:11,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:11,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:11,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:11,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:11,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:11,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:11,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:11,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:11,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:11,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:11,776 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:11,776 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:11,778 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:11,778 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:11,778 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:11,779 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:11,780 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:11,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:11,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:11,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:11,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:11,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:11,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:11,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:11,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:11,958 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 05:02:11,961 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 05:02:11,962 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-06-22 05:02:12,209 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 89 states and 172 transitions. Complement of second has 16 states. [2020-06-22 05:02:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states [2020-06-22 05:02:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 05:02:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2020-06-22 05:02:12,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 05:02:12,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:12,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 05:02:12,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:12,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 1 letters. Loop has 8 letters. [2020-06-22 05:02:12,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:12,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 172 transitions. [2020-06-22 05:02:12,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2020-06-22 05:02:12,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 68 states and 116 transitions. [2020-06-22 05:02:12,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-06-22 05:02:12,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-06-22 05:02:12,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 116 transitions. [2020-06-22 05:02:12,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:12,229 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 116 transitions. [2020-06-22 05:02:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 116 transitions. [2020-06-22 05:02:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-06-22 05:02:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 05:02:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 103 transitions. [2020-06-22 05:02:12,236 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 103 transitions. [2020-06-22 05:02:12,237 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 103 transitions. [2020-06-22 05:02:12,237 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:02:12,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 103 transitions. [2020-06-22 05:02:12,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2020-06-22 05:02:12,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:12,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:12,240 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 05:02:12,240 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:02:12,240 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 225#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 230#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 231#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 277#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 250#L18-1 [2020-06-22 05:02:12,241 INFO L796 eck$LassoCheckResult]: Loop: 250#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 274#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 275#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 266#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 250#L18-1 [2020-06-22 05:02:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 1 times [2020-06-22 05:02:12,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:12,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2200580, now seen corresponding path program 1 times [2020-06-22 05:02:12,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:12,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1809524160, now seen corresponding path program 1 times [2020-06-22 05:02:12,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:12,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:12,322 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:12,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:12,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:12,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:12,323 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:12,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:12,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:12,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:12,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:02:12,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:12,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:12,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:12,410 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:12,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:12,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:12,445 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:12,445 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:12,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:12,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:12,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:12,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:12,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:12,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:12,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:12,511 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:12,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:12,517 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:12,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:12,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:12,552 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:12,576 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:12,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:12,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:12,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:12,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:12,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:12,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:12,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:12,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:02:12,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:12,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:12,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:12,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:12,652 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:12,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:12,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:12,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:12,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:12,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:12,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:12,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:12,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:12,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:12,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:12,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:12,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:12,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:12,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:12,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:12,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:12,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:12,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:12,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:12,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:12,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:12,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:12,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:12,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:12,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:12,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:12,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:12,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:12,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:12,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:12,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:12,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:12,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:12,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:12,681 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:12,682 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:02:12,682 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:12,682 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:12,682 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:12,682 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-06-22 05:02:12,683 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:12,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:12,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:12,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:12,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:12,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:12,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:12,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:12,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:12,816 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:02:12,816 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 [2020-06-22 05:02:12,816 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 59 states and 103 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-06-22 05:02:12,964 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 59 states and 103 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 362 states and 605 transitions. Complement of second has 24 states. [2020-06-22 05:02:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:02:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-06-22 05:02:12,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 05:02:12,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:12,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 05:02:12,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:12,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 05:02:12,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:12,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 605 transitions. [2020-06-22 05:02:12,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2020-06-22 05:02:12,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 151 states and 255 transitions. [2020-06-22 05:02:12,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-06-22 05:02:12,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2020-06-22 05:02:12,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 255 transitions. [2020-06-22 05:02:12,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:12,980 INFO L706 BuchiCegarLoop]: Abstraction has 151 states and 255 transitions. [2020-06-22 05:02:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 255 transitions. [2020-06-22 05:02:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2020-06-22 05:02:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-06-22 05:02:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 206 transitions. [2020-06-22 05:02:12,991 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 206 transitions. [2020-06-22 05:02:12,991 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 206 transitions. [2020-06-22 05:02:12,991 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:02:12,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 206 transitions. [2020-06-22 05:02:12,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 74 [2020-06-22 05:02:12,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:12,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:12,994 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 05:02:12,994 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2020-06-22 05:02:12,994 INFO L794 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 737#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 738#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 744#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 831#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 756#L18-1 [2020-06-22 05:02:12,995 INFO L796 eck$LassoCheckResult]: Loop: 756#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 827#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 758#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 759#L15-1 [60] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (< 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 816#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 814#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 792#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 793#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 756#L18-1 [2020-06-22 05:02:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 2 times [2020-06-22 05:02:12,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:12,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1237277946, now seen corresponding path program 1 times [2020-06-22 05:02:13,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:13,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:02:13,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 05:02:13,016 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:13,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:02:13,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:02:13,017 INFO L87 Difference]: Start difference. First operand 121 states and 206 transitions. cyclomatic complexity: 89 Second operand 3 states. [2020-06-22 05:02:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:13,033 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2020-06-22 05:02:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:02:13,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 179 transitions. [2020-06-22 05:02:13,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2020-06-22 05:02:13,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 111 states and 167 transitions. [2020-06-22 05:02:13,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2020-06-22 05:02:13,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2020-06-22 05:02:13,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 167 transitions. [2020-06-22 05:02:13,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:13,039 INFO L706 BuchiCegarLoop]: Abstraction has 111 states and 167 transitions. [2020-06-22 05:02:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 167 transitions. [2020-06-22 05:02:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2020-06-22 05:02:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-06-22 05:02:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2020-06-22 05:02:13,046 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-06-22 05:02:13,046 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-06-22 05:02:13,046 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 05:02:13,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2020-06-22 05:02:13,047 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2020-06-22 05:02:13,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:13,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:13,048 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 05:02:13,048 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 05:02:13,049 INFO L794 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 984#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1015#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1074#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1073#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1029#L18-1 [2020-06-22 05:02:13,049 INFO L796 eck$LassoCheckResult]: Loop: 1029#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1068#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1064#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1061#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1066#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1063#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1060#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1050#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1029#L18-1 [2020-06-22 05:02:13,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,049 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 3 times [2020-06-22 05:02:13,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1236367228, now seen corresponding path program 1 times [2020-06-22 05:02:13,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:13,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:13,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:13,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 05:02:13,123 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 05:02:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:02:13,124 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 61 Second operand 4 states. [2020-06-22 05:02:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:13,161 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2020-06-22 05:02:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 05:02:13,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 183 transitions. [2020-06-22 05:02:13,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 73 [2020-06-22 05:02:13,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 180 transitions. [2020-06-22 05:02:13,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-06-22 05:02:13,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2020-06-22 05:02:13,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 180 transitions. [2020-06-22 05:02:13,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:13,167 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 180 transitions. [2020-06-22 05:02:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 180 transitions. [2020-06-22 05:02:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2020-06-22 05:02:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-06-22 05:02:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2020-06-22 05:02:13,174 INFO L729 BuchiCegarLoop]: Abstraction has 113 states and 168 transitions. [2020-06-22 05:02:13,174 INFO L609 BuchiCegarLoop]: Abstraction has 113 states and 168 transitions. [2020-06-22 05:02:13,174 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 05:02:13,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 168 transitions. [2020-06-22 05:02:13,175 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2020-06-22 05:02:13,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:13,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:13,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 05:02:13,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-06-22 05:02:13,176 INFO L794 eck$LassoCheckResult]: Stem: 1240#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1241#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1274#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1330#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1329#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1314#L18-1 [2020-06-22 05:02:13,177 INFO L796 eck$LassoCheckResult]: Loop: 1314#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1327#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1326#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1325#L15-1 [60] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (< 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1324#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1323#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1320#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1321#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1314#L18-1 [2020-06-22 05:02:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash 64999357, now seen corresponding path program 4 times [2020-06-22 05:02:13,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,184 INFO L82 PathProgramCache]: Analyzing trace with hash 777440395, now seen corresponding path program 1 times [2020-06-22 05:02:13,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 456728647, now seen corresponding path program 1 times [2020-06-22 05:02:13,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:13,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:13,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 05:02:13,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 05:02:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2020-06-22 05:02:13,299 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:13,299 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:13,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:13,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:13,299 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:13,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:13,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:13,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:13,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 05:02:13,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:13,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:13,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,358 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:13,358 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:13,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:13,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:13,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:13,365 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=1} Honda state: {ULTIMATE.start_main_~i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:13,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:13,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:13,418 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:13,419 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:13,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:13,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:13,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:13,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:13,483 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:13,485 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:13,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:13,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:13,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:13,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:13,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:13,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:13,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:13,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 05:02:13,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:13,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:13,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:13,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:13,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:13,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:13,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:13,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:13,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:13,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:13,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:13,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:13,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:13,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:13,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:13,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:13,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:13,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:13,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:13,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:13,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:13,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:13,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:13,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:13,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:13,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:13,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:13,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:13,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:13,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:13,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:13,562 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:13,562 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:13,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:13,563 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:13,563 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:13,563 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~up~0) = 1*ULTIMATE.start_main_~up~0 Supporting invariants [] [2020-06-22 05:02:13,563 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,650 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 05:02:13,651 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 05:02:13,651 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 113 states and 168 transitions. cyclomatic complexity: 60 Second operand 5 states. [2020-06-22 05:02:13,715 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 113 states and 168 transitions. cyclomatic complexity: 60. Second operand 5 states. Result 405 states and 595 transitions. Complement of second has 36 states. [2020-06-22 05:02:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:02:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-06-22 05:02:13,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 05:02:13,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:13,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 13 letters. Loop has 8 letters. [2020-06-22 05:02:13,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:13,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 5 letters. Loop has 16 letters. [2020-06-22 05:02:13,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:13,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 595 transitions. [2020-06-22 05:02:13,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 05:02:13,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 76 states and 101 transitions. [2020-06-22 05:02:13,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 05:02:13,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-06-22 05:02:13,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. [2020-06-22 05:02:13,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:13,728 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2020-06-22 05:02:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. [2020-06-22 05:02:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2020-06-22 05:02:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-06-22 05:02:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2020-06-22 05:02:13,732 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 83 transitions. [2020-06-22 05:02:13,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 05:02:13,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:02:13,732 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 4 states. [2020-06-22 05:02:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:13,747 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-06-22 05:02:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 05:02:13,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-06-22 05:02:13,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 05:02:13,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2020-06-22 05:02:13,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 05:02:13,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 05:02:13,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2020-06-22 05:02:13,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:13,750 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-06-22 05:02:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2020-06-22 05:02:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-06-22 05:02:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 05:02:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-06-22 05:02:13,753 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-06-22 05:02:13,753 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-06-22 05:02:13,753 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 05:02:13,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2020-06-22 05:02:13,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 05:02:13,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:13,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:13,754 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:13,754 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 05:02:13,754 INFO L794 eck$LassoCheckResult]: Stem: 2025#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2026#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2042#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2039#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2038#L15-1 [2020-06-22 05:02:13,754 INFO L796 eck$LassoCheckResult]: Loop: 2038#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2037#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2031#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2021#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2022#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2027#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2028#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2047#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2043#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2045#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2040#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2041#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2038#L15-1 [2020-06-22 05:02:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 1 times [2020-06-22 05:02:13,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash 87680373, now seen corresponding path program 2 times [2020-06-22 05:02:13,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:13,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:13,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 05:02:13,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 05:02:13,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:13,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:13,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 05:02:13,834 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:02:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:02:13,835 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 05:02:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:13,867 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-06-22 05:02:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:02:13,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2020-06-22 05:02:13,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 05:02:13,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 50 transitions. [2020-06-22 05:02:13,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 05:02:13,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 05:02:13,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-06-22 05:02:13,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:13,870 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-06-22 05:02:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-06-22 05:02:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-06-22 05:02:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 05:02:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-06-22 05:02:13,872 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-06-22 05:02:13,872 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-06-22 05:02:13,872 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 05:02:13,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-06-22 05:02:13,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 05:02:13,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:13,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:13,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:13,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] [2020-06-22 05:02:13,874 INFO L794 eck$LassoCheckResult]: Stem: 2134#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2135#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2145#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2150#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2149#L15-1 [2020-06-22 05:02:13,874 INFO L796 eck$LassoCheckResult]: Loop: 2149#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2148#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2140#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2130#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2131#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2136#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2137#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2161#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2160#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2159#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2158#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2157#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2156#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2154#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2151#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2152#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2149#L15-1 [2020-06-22 05:02:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 2 times [2020-06-22 05:02:13,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1668514628, now seen corresponding path program 3 times [2020-06-22 05:02:13,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:13,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:13,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:13,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 05:02:13,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-06-22 05:02:13,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:13,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:13,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:13,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:13,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 05:02:13,976 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:02:13,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:02:13,977 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-06-22 05:02:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:14,020 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2020-06-22 05:02:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:02:14,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2020-06-22 05:02:14,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 05:02:14,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 60 transitions. [2020-06-22 05:02:14,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 05:02:14,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 05:02:14,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2020-06-22 05:02:14,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:14,023 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2020-06-22 05:02:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2020-06-22 05:02:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2020-06-22 05:02:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 05:02:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2020-06-22 05:02:14,025 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2020-06-22 05:02:14,025 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2020-06-22 05:02:14,025 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 05:02:14,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. [2020-06-22 05:02:14,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-06-22 05:02:14,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:14,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:14,026 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:14,026 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2020-06-22 05:02:14,027 INFO L794 eck$LassoCheckResult]: Stem: 2272#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2273#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2282#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2288#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2287#L15-1 [2020-06-22 05:02:14,027 INFO L796 eck$LassoCheckResult]: Loop: 2287#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2286#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2278#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2268#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2269#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2274#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2275#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2304#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2303#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2302#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2301#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2300#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2299#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2298#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2297#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2296#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2294#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2292#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2289#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2290#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2287#L15-1 [2020-06-22 05:02:14,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 3 times [2020-06-22 05:02:14,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1392795245, now seen corresponding path program 4 times [2020-06-22 05:02:14,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:14,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 05:02:14,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 05:02:14,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:14,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:14,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 05:02:14,129 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 05:02:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 05:02:14,130 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-06-22 05:02:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:14,163 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2020-06-22 05:02:14,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:02:14,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2020-06-22 05:02:14,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-06-22 05:02:14,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 70 transitions. [2020-06-22 05:02:14,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-06-22 05:02:14,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-06-22 05:02:14,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2020-06-22 05:02:14,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:14,167 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-06-22 05:02:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2020-06-22 05:02:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2020-06-22 05:02:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-06-22 05:02:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2020-06-22 05:02:14,169 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2020-06-22 05:02:14,169 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2020-06-22 05:02:14,169 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 05:02:14,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2020-06-22 05:02:14,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-06-22 05:02:14,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:14,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:14,170 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:14,170 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1] [2020-06-22 05:02:14,171 INFO L794 eck$LassoCheckResult]: Stem: 2439#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2440#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2449#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2455#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2454#L15-1 [2020-06-22 05:02:14,171 INFO L796 eck$LassoCheckResult]: Loop: 2454#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2453#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2445#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2435#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2436#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2441#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2442#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2475#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2474#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2473#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2472#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2471#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2470#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2469#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2468#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2467#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2466#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2465#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2464#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2463#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2461#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2459#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2456#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2457#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2454#L15-1 [2020-06-22 05:02:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 4 times [2020-06-22 05:02:14,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1650589598, now seen corresponding path program 5 times [2020-06-22 05:02:14,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:14,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:14,238 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 05:02:14,249 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-06-22 05:02:14,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:14,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:14,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 05:02:14,282 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:02:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:02:14,283 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-06-22 05:02:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:14,321 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2020-06-22 05:02:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 05:02:14,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 82 transitions. [2020-06-22 05:02:14,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-06-22 05:02:14,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 63 states and 80 transitions. [2020-06-22 05:02:14,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-06-22 05:02:14,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-06-22 05:02:14,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 80 transitions. [2020-06-22 05:02:14,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:14,324 INFO L706 BuchiCegarLoop]: Abstraction has 63 states and 80 transitions. [2020-06-22 05:02:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 80 transitions. [2020-06-22 05:02:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-06-22 05:02:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 05:02:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2020-06-22 05:02:14,326 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2020-06-22 05:02:14,326 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2020-06-22 05:02:14,326 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 05:02:14,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2020-06-22 05:02:14,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-06-22 05:02:14,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:14,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:14,328 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:14,328 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 6, 1, 1, 1] [2020-06-22 05:02:14,328 INFO L794 eck$LassoCheckResult]: Stem: 2635#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2636#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2647#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2653#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2652#L15-1 [2020-06-22 05:02:14,329 INFO L796 eck$LassoCheckResult]: Loop: 2652#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2651#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2641#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2642#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2675#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2637#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2638#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2631#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2632#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2644#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2674#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2673#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2672#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2671#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2670#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2669#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2668#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2667#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2666#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2665#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2664#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2663#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2662#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2661#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2659#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2657#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2654#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2655#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2652#L15-1 [2020-06-22 05:02:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 5 times [2020-06-22 05:02:14,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1522114639, now seen corresponding path program 6 times [2020-06-22 05:02:14,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:14,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:14,412 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 05:02:14,424 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-06-22 05:02:14,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:14,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:14,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:14,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 05:02:14,458 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 05:02:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 05:02:14,459 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 18 Second operand 9 states. [2020-06-22 05:02:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:14,529 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2020-06-22 05:02:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 05:02:14,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2020-06-22 05:02:14,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 05:02:14,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 71 states and 90 transitions. [2020-06-22 05:02:14,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-06-22 05:02:14,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-06-22 05:02:14,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 90 transitions. [2020-06-22 05:02:14,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:14,533 INFO L706 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2020-06-22 05:02:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 90 transitions. [2020-06-22 05:02:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2020-06-22 05:02:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-06-22 05:02:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2020-06-22 05:02:14,535 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2020-06-22 05:02:14,536 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2020-06-22 05:02:14,536 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 05:02:14,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. [2020-06-22 05:02:14,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-06-22 05:02:14,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:14,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:14,537 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:14,537 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 7, 1, 1, 1] [2020-06-22 05:02:14,537 INFO L794 eck$LassoCheckResult]: Stem: 2860#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2861#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2872#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2878#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2877#L15-1 [2020-06-22 05:02:14,538 INFO L796 eck$LassoCheckResult]: Loop: 2877#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2876#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2866#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2867#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2903#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2862#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2863#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2856#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2857#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2869#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2902#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2901#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2900#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2899#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2898#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2897#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2896#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2895#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2894#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2893#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2892#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2891#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2890#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2889#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2888#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2887#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2886#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2885#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2883#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2881#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2879#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2880#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2877#L15-1 [2020-06-22 05:02:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 6 times [2020-06-22 05:02:14,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash -671056000, now seen corresponding path program 7 times [2020-06-22 05:02:14,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:14,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:14,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:14,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:14,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:14,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:14,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 05:02:14,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 05:02:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 05:02:14,686 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. cyclomatic complexity: 20 Second operand 10 states. [2020-06-22 05:02:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:14,768 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-06-22 05:02:14,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 05:02:14,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 102 transitions. [2020-06-22 05:02:14,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-06-22 05:02:14,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 100 transitions. [2020-06-22 05:02:14,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-06-22 05:02:14,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-06-22 05:02:14,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2020-06-22 05:02:14,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:14,772 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 100 transitions. [2020-06-22 05:02:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2020-06-22 05:02:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2020-06-22 05:02:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-06-22 05:02:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2020-06-22 05:02:14,775 INFO L729 BuchiCegarLoop]: Abstraction has 75 states and 95 transitions. [2020-06-22 05:02:14,775 INFO L609 BuchiCegarLoop]: Abstraction has 75 states and 95 transitions. [2020-06-22 05:02:14,775 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 05:02:14,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 95 transitions. [2020-06-22 05:02:14,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2020-06-22 05:02:14,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:14,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:14,776 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:14,776 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 1, 1, 1] [2020-06-22 05:02:14,777 INFO L794 eck$LassoCheckResult]: Stem: 3114#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3115#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3124#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3130#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3129#L15-1 [2020-06-22 05:02:14,777 INFO L796 eck$LassoCheckResult]: Loop: 3129#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3128#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3120#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3110#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3111#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3116#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3117#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3162#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3161#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3160#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3159#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3158#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3157#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3156#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3155#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3154#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3153#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3152#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3151#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3150#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3149#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3148#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3147#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3146#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3145#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3144#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3143#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3142#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3141#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3140#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3139#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3138#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3136#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3134#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3131#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3132#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3129#L15-1 [2020-06-22 05:02:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 7 times [2020-06-22 05:02:14,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:14,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash -570941489, now seen corresponding path program 8 times [2020-06-22 05:02:14,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:14,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 05:02:14,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 05:02:14,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:14,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:14,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:14,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:14,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-06-22 05:02:14,958 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 05:02:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 05:02:14,959 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. cyclomatic complexity: 22 Second operand 11 states. [2020-06-22 05:02:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:15,043 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2020-06-22 05:02:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 05:02:15,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 112 transitions. [2020-06-22 05:02:15,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-06-22 05:02:15,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 87 states and 110 transitions. [2020-06-22 05:02:15,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-06-22 05:02:15,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-06-22 05:02:15,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2020-06-22 05:02:15,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:15,047 INFO L706 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2020-06-22 05:02:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2020-06-22 05:02:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2020-06-22 05:02:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-06-22 05:02:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2020-06-22 05:02:15,049 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2020-06-22 05:02:15,049 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2020-06-22 05:02:15,049 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 05:02:15,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 105 transitions. [2020-06-22 05:02:15,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-06-22 05:02:15,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:15,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:15,051 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:15,051 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] [2020-06-22 05:02:15,051 INFO L794 eck$LassoCheckResult]: Stem: 3397#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3398#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3409#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3415#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3414#L15-1 [2020-06-22 05:02:15,052 INFO L796 eck$LassoCheckResult]: Loop: 3414#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3413#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3403#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3404#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3449#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3399#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3400#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3393#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3394#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3406#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3448#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3447#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3446#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3445#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3444#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3443#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3442#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3441#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3440#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3439#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3438#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3437#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3436#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3435#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3434#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3433#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3432#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3431#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3430#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3429#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3428#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3427#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3426#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3425#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3424#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3423#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3421#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3419#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3416#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3417#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3414#L15-1 [2020-06-22 05:02:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 8 times [2020-06-22 05:02:15,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:15,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:15,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash -478609250, now seen corresponding path program 9 times [2020-06-22 05:02:15,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:15,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:15,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:15,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 05:02:15,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-06-22 05:02:15,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:15,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:15,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:02:15,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:15,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-06-22 05:02:15,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:02:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 05:02:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-06-22 05:02:15,249 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. cyclomatic complexity: 24 Second operand 12 states. [2020-06-22 05:02:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:15,393 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2020-06-22 05:02:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 05:02:15,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 169 transitions. [2020-06-22 05:02:15,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-06-22 05:02:15,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 134 states and 166 transitions. [2020-06-22 05:02:15,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-06-22 05:02:15,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2020-06-22 05:02:15,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 166 transitions. [2020-06-22 05:02:15,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:15,397 INFO L706 BuchiCegarLoop]: Abstraction has 134 states and 166 transitions. [2020-06-22 05:02:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 166 transitions. [2020-06-22 05:02:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2020-06-22 05:02:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2020-06-22 05:02:15,401 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 154 transitions. [2020-06-22 05:02:15,401 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 154 transitions. [2020-06-22 05:02:15,401 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2020-06-22 05:02:15,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 154 transitions. [2020-06-22 05:02:15,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:15,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:15,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:15,403 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:15,403 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 10, 1, 1, 1] [2020-06-22 05:02:15,404 INFO L794 eck$LassoCheckResult]: Stem: 3749#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 3750#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3760#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3762#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3763#L15-1 [2020-06-22 05:02:15,404 INFO L796 eck$LassoCheckResult]: Loop: 3763#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3867#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3752#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3767#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3807#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3806#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3805#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3804#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3803#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3802#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3801#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3800#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3799#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3798#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3797#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3796#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3795#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3794#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3793#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3792#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3791#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3790#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3789#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3788#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3787#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3786#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3785#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3784#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3783#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3782#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3781#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3780#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3779#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3778#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3777#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3776#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3775#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3774#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3773#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3772#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3765#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3769#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3766#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3764#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 3763#L15-1 [2020-06-22 05:02:15,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 9 times [2020-06-22 05:02:15,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:15,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:15,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:15,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:15,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1997610515, now seen corresponding path program 10 times [2020-06-22 05:02:15,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:15,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:15,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:15,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1556204068, now seen corresponding path program 1 times [2020-06-22 05:02:15,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:15,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:15,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:02:15,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 05:02:15,664 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2020-06-22 05:02:15,672 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:15,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:15,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:15,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:15,673 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:15,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:15,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:15,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:15,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-06-22 05:02:15,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:15,674 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:15,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,739 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:15,739 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:15,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:15,742 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:15,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:15,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:15,775 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:15,802 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:15,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:15,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:15,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:15,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:15,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:15,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:15,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:15,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop [2020-06-22 05:02:15,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:15,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:15,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:15,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:15,857 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:15,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:15,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:15,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:15,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:15,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:15,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:15,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:15,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:15,862 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:15,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:15,864 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:15,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:15,864 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:15,864 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:15,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:15,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:15,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:15,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:15,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:15,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-06-22 05:02:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:15,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:15,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:16,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:02:16,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:16,813 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 05:02:16,814 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 [2020-06-22 05:02:16,814 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 154 transitions. cyclomatic complexity: 33 Second operand 5 states. [2020-06-22 05:02:16,926 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 154 transitions. cyclomatic complexity: 33. Second operand 5 states. Result 450 states and 554 transitions. Complement of second has 28 states. [2020-06-22 05:02:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:02:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2020-06-22 05:02:16,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 4 letters. Loop has 44 letters. [2020-06-22 05:02:16,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:16,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 48 letters. Loop has 44 letters. [2020-06-22 05:02:16,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:16,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 4 letters. Loop has 88 letters. [2020-06-22 05:02:16,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:16,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 554 transitions. [2020-06-22 05:02:16,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:16,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 128 states and 158 transitions. [2020-06-22 05:02:16,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-06-22 05:02:16,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-06-22 05:02:16,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 158 transitions. [2020-06-22 05:02:16,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:16,938 INFO L706 BuchiCegarLoop]: Abstraction has 128 states and 158 transitions. [2020-06-22 05:02:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 158 transitions. [2020-06-22 05:02:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2020-06-22 05:02:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2020-06-22 05:02:16,942 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2020-06-22 05:02:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 05:02:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:02:16,942 INFO L87 Difference]: Start difference. First operand 123 states and 153 transitions. Second operand 4 states. [2020-06-22 05:02:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:16,966 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2020-06-22 05:02:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 05:02:16,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 153 transitions. [2020-06-22 05:02:16,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:16,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 153 transitions. [2020-06-22 05:02:16,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:16,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:16,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 153 transitions. [2020-06-22 05:02:16,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:16,970 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2020-06-22 05:02:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 153 transitions. [2020-06-22 05:02:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2020-06-22 05:02:16,973 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2020-06-22 05:02:16,973 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 153 transitions. [2020-06-22 05:02:16,973 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2020-06-22 05:02:16,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 153 transitions. [2020-06-22 05:02:16,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:16,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:16,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:16,975 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:16,975 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2020-06-22 05:02:16,975 INFO L794 eck$LassoCheckResult]: Stem: 10192#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 10193#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10201#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10203#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 10204#L15-1 [2020-06-22 05:02:16,976 INFO L796 eck$LassoCheckResult]: Loop: 10204#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10194#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10195#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10188#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10189#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10200#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10278#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 10208#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10277#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10276#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10275#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10274#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10273#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10272#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10269#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10268#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10266#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10264#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10262#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10260#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10258#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10256#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10254#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10252#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10250#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10248#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10246#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10244#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10242#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10240#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10238#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10236#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10234#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10232#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10230#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10228#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10226#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10224#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10222#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10220#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10218#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10216#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10214#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10213#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 10206#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 10210#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 10207#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 10205#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 10204#L15-1 [2020-06-22 05:02:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 10 times [2020-06-22 05:02:16,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:16,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash -419915894, now seen corresponding path program 11 times [2020-06-22 05:02:16,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:16,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:16,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:16,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:16,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -527541255, now seen corresponding path program 2 times [2020-06-22 05:02:16,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:16,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:17,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:17,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:17,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 05:02:17,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 05:02:17,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:17,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 05:02:17,314 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 49 [2020-06-22 05:02:17,329 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:17,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:17,329 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:17,329 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:17,329 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:17,329 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:17,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:17,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:17,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-06-22 05:02:17,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:17,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:17,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,393 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:17,394 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:17,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:17,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:17,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:17,401 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:17,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:17,427 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:17,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:17,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:17,460 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:17,483 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:17,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:17,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:17,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:17,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:17,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:17,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:17,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:17,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop [2020-06-22 05:02:17,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:17,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:17,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:17,538 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:17,538 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:17,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:17,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:17,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:17,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:17,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:17,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:17,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:17,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:17,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:17,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:17,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:17,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:17,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:17,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:17,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:17,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:17,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:17,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:17,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:17,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:17,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:17,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:17,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:17,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:17,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:17,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:17,550 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:17,551 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:17,551 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:17,551 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:17,551 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:17,551 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:17,552 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:17,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:17,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:02:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:18,756 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 05:02:18,756 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 13 loop predicates [2020-06-22 05:02:18,756 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 153 transitions. cyclomatic complexity: 32 Second operand 5 states. [2020-06-22 05:02:19,046 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 153 transitions. cyclomatic complexity: 32. Second operand 5 states. Result 482 states and 582 transitions. Complement of second has 44 states. [2020-06-22 05:02:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:02:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2020-06-22 05:02:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 4 letters. Loop has 48 letters. [2020-06-22 05:02:19,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:19,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 52 letters. Loop has 48 letters. [2020-06-22 05:02:19,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:19,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 4 letters. Loop has 96 letters. [2020-06-22 05:02:19,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:19,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 582 transitions. [2020-06-22 05:02:19,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:19,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 132 states and 161 transitions. [2020-06-22 05:02:19,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2020-06-22 05:02:19,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2020-06-22 05:02:19,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 161 transitions. [2020-06-22 05:02:19,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:19,060 INFO L706 BuchiCegarLoop]: Abstraction has 132 states and 161 transitions. [2020-06-22 05:02:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 161 transitions. [2020-06-22 05:02:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2020-06-22 05:02:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. [2020-06-22 05:02:19,063 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. [2020-06-22 05:02:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:02:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:02:19,064 INFO L87 Difference]: Start difference. First operand 123 states and 152 transitions. Second operand 5 states. [2020-06-22 05:02:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:19,089 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2020-06-22 05:02:19,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:02:19,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 152 transitions. [2020-06-22 05:02:19,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:19,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 152 transitions. [2020-06-22 05:02:19,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:19,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:19,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 152 transitions. [2020-06-22 05:02:19,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:19,093 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. [2020-06-22 05:02:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 152 transitions. [2020-06-22 05:02:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. [2020-06-22 05:02:19,096 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. [2020-06-22 05:02:19,096 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 152 transitions. [2020-06-22 05:02:19,097 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2020-06-22 05:02:19,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 152 transitions. [2020-06-22 05:02:19,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:19,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:19,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:19,098 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:19,098 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2020-06-22 05:02:19,099 INFO L794 eck$LassoCheckResult]: Stem: 17935#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 17936#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17944#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17946#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 17947#L15-1 [2020-06-22 05:02:19,099 INFO L796 eck$LassoCheckResult]: Loop: 17947#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18023#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18026#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18024#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18025#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17937#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17938#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17931#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17932#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17943#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18021#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 17951#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18020#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18019#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18018#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18017#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18016#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18015#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18012#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18011#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18009#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 18007#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 18005#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 18003#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 18001#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17999#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17997#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17995#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17993#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17991#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17989#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17987#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17985#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17983#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17981#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17979#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17977#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17975#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17973#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17971#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17969#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17967#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17965#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17963#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17961#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17959#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17957#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17956#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 17949#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 17953#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 17950#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 17948#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 17947#L15-1 [2020-06-22 05:02:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 11 times [2020-06-22 05:02:19,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:19,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:19,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 398735015, now seen corresponding path program 12 times [2020-06-22 05:02:19,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:19,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash 250882966, now seen corresponding path program 3 times [2020-06-22 05:02:19,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:19,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 151 proven. 10 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:19,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:19,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:19,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 05:02:19,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-06-22 05:02:19,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:19,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 151 proven. 10 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:19,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:19,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 05:02:19,454 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 51 [2020-06-22 05:02:19,462 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:19,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:19,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:19,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:19,462 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:19,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:19,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:19,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:19,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop [2020-06-22 05:02:19,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:19,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:19,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:19,517 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:19,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:19,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:19,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:19,524 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:19,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:19,551 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:19,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:19,580 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:19,585 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:19,610 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:19,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:19,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:19,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:19,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:19,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:19,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:19,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:19,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop [2020-06-22 05:02:19,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:19,611 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:19,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:19,661 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:19,661 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:19,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:19,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:19,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:19,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:19,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:19,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:19,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:19,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:19,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:19,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:19,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:19,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:19,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:19,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:19,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:19,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:19,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:19,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:19,668 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:19,669 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:19,669 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:19,669 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:19,669 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:19,669 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:19,669 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:19,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:19,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:20,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:20,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:21,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:21,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:21,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:02:21,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:21,099 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 16 predicates after loop cannibalization [2020-06-22 05:02:21,099 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 16 loop predicates [2020-06-22 05:02:21,100 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 152 transitions. cyclomatic complexity: 31 Second operand 6 states. [2020-06-22 05:02:21,411 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 152 transitions. cyclomatic complexity: 31. Second operand 6 states. Result 514 states and 610 transitions. Complement of second has 56 states. [2020-06-22 05:02:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 05:02:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-06-22 05:02:21,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 52 letters. [2020-06-22 05:02:21,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:21,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 56 letters. Loop has 52 letters. [2020-06-22 05:02:21,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:21,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 104 letters. [2020-06-22 05:02:21,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:21,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 610 transitions. [2020-06-22 05:02:21,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:21,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 136 states and 164 transitions. [2020-06-22 05:02:21,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2020-06-22 05:02:21,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2020-06-22 05:02:21,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 164 transitions. [2020-06-22 05:02:21,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:21,423 INFO L706 BuchiCegarLoop]: Abstraction has 136 states and 164 transitions. [2020-06-22 05:02:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 164 transitions. [2020-06-22 05:02:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2020-06-22 05:02:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2020-06-22 05:02:21,426 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. [2020-06-22 05:02:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:02:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:02:21,427 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand 6 states. [2020-06-22 05:02:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:21,458 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2020-06-22 05:02:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:02:21,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 151 transitions. [2020-06-22 05:02:21,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:21,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 151 transitions. [2020-06-22 05:02:21,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:21,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:21,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 151 transitions. [2020-06-22 05:02:21,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:21,461 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. [2020-06-22 05:02:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 151 transitions. [2020-06-22 05:02:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2020-06-22 05:02:21,464 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. [2020-06-22 05:02:21,464 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 151 transitions. [2020-06-22 05:02:21,465 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2020-06-22 05:02:21,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 151 transitions. [2020-06-22 05:02:21,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:21,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:21,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:21,466 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:21,466 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2020-06-22 05:02:21,466 INFO L794 eck$LassoCheckResult]: Stem: 26923#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 26924#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26934#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26935#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26936#L15-1 [2020-06-22 05:02:21,467 INFO L796 eck$LassoCheckResult]: Loop: 26936#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 27012#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 27017#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 27013#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 27014#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 27019#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 27015#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 27016#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 27018#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26925#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26926#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 27041#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 27040#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 27020#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 27010#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26940#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 27009#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 27008#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 27007#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 27006#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 27005#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 27004#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 27001#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 27000#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26998#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26996#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26994#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26992#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26990#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26988#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26986#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26984#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26982#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26980#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26978#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26976#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26974#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26972#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26970#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26968#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26966#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26964#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26962#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26960#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26958#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26956#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26954#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26952#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26950#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26948#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26946#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26945#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 26938#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26942#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 26939#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 26937#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 26936#L15-1 [2020-06-22 05:02:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 12 times [2020-06-22 05:02:21,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:21,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:21,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:21,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:21,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1388249276, now seen corresponding path program 13 times [2020-06-22 05:02:21,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:21,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:21,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:21,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash -260119373, now seen corresponding path program 4 times [2020-06-22 05:02:21,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:21,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:21,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:21,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:21,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 195 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:21,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:21,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:21,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 05:02:21,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 05:02:21,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:21,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:21,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 195 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 05:02:21,859 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2020-06-22 05:02:21,866 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:21,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:21,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:21,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:21,866 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:21,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:21,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:21,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:21,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop [2020-06-22 05:02:21,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:21,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:21,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:21,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:21,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:21,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:21,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:21,917 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:21,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:21,920 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:21,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:21,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:21,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:21,951 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:21,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:21,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:21,983 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:22,006 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:22,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:22,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:22,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:22,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:22,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:22,007 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:22,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:22,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration19_Loop [2020-06-22 05:02:22,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:22,007 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:22,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:22,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:22,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:22,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:22,058 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:22,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:22,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:22,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:22,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:22,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:22,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:22,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:22,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:22,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:22,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:22,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:22,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:22,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:22,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:22,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:22,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:22,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:22,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:22,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:22,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:22,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:22,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:22,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:22,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:22,068 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:22,069 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:22,069 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:22,069 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:22,069 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:22,070 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:22,070 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:22,070 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:22,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:22,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:23,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:02:23,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:23,773 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 19 predicates after loop cannibalization [2020-06-22 05:02:23,773 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 19 loop predicates [2020-06-22 05:02:23,774 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 151 transitions. cyclomatic complexity: 30 Second operand 7 states. [2020-06-22 05:02:24,186 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 151 transitions. cyclomatic complexity: 30. Second operand 7 states. Result 546 states and 638 transitions. Complement of second has 68 states. [2020-06-22 05:02:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 05:02:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2020-06-22 05:02:24,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 62 transitions. Stem has 4 letters. Loop has 56 letters. [2020-06-22 05:02:24,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:24,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 62 transitions. Stem has 60 letters. Loop has 56 letters. [2020-06-22 05:02:24,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:24,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 62 transitions. Stem has 4 letters. Loop has 112 letters. [2020-06-22 05:02:24,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:24,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 638 transitions. [2020-06-22 05:02:24,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:24,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 140 states and 167 transitions. [2020-06-22 05:02:24,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2020-06-22 05:02:24,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-06-22 05:02:24,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 167 transitions. [2020-06-22 05:02:24,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:24,195 INFO L706 BuchiCegarLoop]: Abstraction has 140 states and 167 transitions. [2020-06-22 05:02:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 167 transitions. [2020-06-22 05:02:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2020-06-22 05:02:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2020-06-22 05:02:24,198 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. [2020-06-22 05:02:24,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 05:02:24,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 05:02:24,199 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand 7 states. [2020-06-22 05:02:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:24,247 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2020-06-22 05:02:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:02:24,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 150 transitions. [2020-06-22 05:02:24,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:24,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 150 transitions. [2020-06-22 05:02:24,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:24,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:24,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 150 transitions. [2020-06-22 05:02:24,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:24,251 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. [2020-06-22 05:02:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 150 transitions. [2020-06-22 05:02:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2020-06-22 05:02:24,254 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. [2020-06-22 05:02:24,254 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 150 transitions. [2020-06-22 05:02:24,254 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2020-06-22 05:02:24,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 150 transitions. [2020-06-22 05:02:24,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:24,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:24,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:24,256 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:24,256 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2020-06-22 05:02:24,256 INFO L794 eck$LassoCheckResult]: Stem: 37253#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 37254#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37264#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37265#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 37266#L15-1 [2020-06-22 05:02:24,257 INFO L796 eck$LassoCheckResult]: Loop: 37266#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37342#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37347#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37343#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37344#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37353#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37345#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37346#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37352#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37351#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37350#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37349#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37348#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37255#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37256#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37371#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37370#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37354#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37340#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 37270#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37339#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37338#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37337#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37336#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37335#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37334#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37331#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37330#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37328#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37326#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37324#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37322#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37320#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37318#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37316#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37314#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37312#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37310#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37308#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37306#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37304#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37302#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37300#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37298#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37296#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37294#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37292#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37290#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37288#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37286#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37284#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37282#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37280#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37278#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37276#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37275#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 37268#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 37272#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 37269#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 37267#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 37266#L15-1 [2020-06-22 05:02:24,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 13 times [2020-06-22 05:02:24,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:24,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:24,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:24,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash 800993633, now seen corresponding path program 14 times [2020-06-22 05:02:24,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:24,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 765314896, now seen corresponding path program 5 times [2020-06-22 05:02:24,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:24,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:24,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:24,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:24,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 239 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:24,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:24,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:24,343 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 05:02:24,365 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2020-06-22 05:02:24,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:24,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:24,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 239 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:24,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:24,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 05:02:24,673 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 57 [2020-06-22 05:02:24,681 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:24,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:24,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:24,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:24,682 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:24,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:24,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:24,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:24,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop [2020-06-22 05:02:24,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:24,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:24,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:24,736 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:24,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:24,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:24,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:24,766 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:24,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:24,770 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:24,796 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:24,796 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:24,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:24,799 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:24,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:24,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:24,832 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:24,855 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:24,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:24,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:24,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:24,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:24,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:24,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:24,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:24,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration20_Loop [2020-06-22 05:02:24,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:24,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:24,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:24,905 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:24,905 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:24,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:24,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:24,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:24,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:24,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:24,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:24,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:24,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:24,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:24,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:24,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:24,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:24,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:24,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:24,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:24,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:24,913 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:24,914 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:24,914 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:24,915 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:24,915 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:24,915 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:24,915 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:24,915 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:24,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:24,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:24,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:24,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:25,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:25,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:26,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:02:26,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:26,761 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 22 predicates after loop cannibalization [2020-06-22 05:02:26,762 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 22 loop predicates [2020-06-22 05:02:26,762 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 150 transitions. cyclomatic complexity: 29 Second operand 8 states. [2020-06-22 05:02:27,402 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 150 transitions. cyclomatic complexity: 29. Second operand 8 states. Result 578 states and 666 transitions. Complement of second has 80 states. [2020-06-22 05:02:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 05:02:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2020-06-22 05:02:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 4 letters. Loop has 60 letters. [2020-06-22 05:02:27,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 64 letters. Loop has 60 letters. [2020-06-22 05:02:27,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:27,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 70 transitions. Stem has 4 letters. Loop has 120 letters. [2020-06-22 05:02:27,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:27,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 666 transitions. [2020-06-22 05:02:27,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:27,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 144 states and 170 transitions. [2020-06-22 05:02:27,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2020-06-22 05:02:27,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2020-06-22 05:02:27,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. [2020-06-22 05:02:27,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:27,415 INFO L706 BuchiCegarLoop]: Abstraction has 144 states and 170 transitions. [2020-06-22 05:02:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. [2020-06-22 05:02:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2020-06-22 05:02:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-06-22 05:02:27,418 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-06-22 05:02:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:02:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:02:27,419 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 8 states. [2020-06-22 05:02:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:27,476 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2020-06-22 05:02:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 05:02:27,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 149 transitions. [2020-06-22 05:02:27,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:27,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 149 transitions. [2020-06-22 05:02:27,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:27,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:27,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 149 transitions. [2020-06-22 05:02:27,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:27,480 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-06-22 05:02:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 149 transitions. [2020-06-22 05:02:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-06-22 05:02:27,483 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-06-22 05:02:27,483 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-06-22 05:02:27,483 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2020-06-22 05:02:27,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 149 transitions. [2020-06-22 05:02:27,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:27,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:27,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:27,485 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:27,485 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2020-06-22 05:02:27,485 INFO L794 eck$LassoCheckResult]: Stem: 49022#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 49023#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49033#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49035#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 49036#L15-1 [2020-06-22 05:02:27,486 INFO L796 eck$LassoCheckResult]: Loop: 49036#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49115#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49114#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49018#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49019#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49032#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49126#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49125#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49124#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49123#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49122#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49121#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49120#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49119#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49118#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49117#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49116#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49024#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49025#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49140#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49139#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49127#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49110#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 49040#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49109#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49108#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49107#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49106#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49105#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49104#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49101#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49100#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49098#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49096#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49094#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49092#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49090#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49088#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49086#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49084#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49082#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49080#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49078#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49076#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49074#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49072#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49070#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49068#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49066#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49064#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49062#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49060#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49058#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49056#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49054#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49052#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49050#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49048#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49046#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49045#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 49038#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 49042#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 49039#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 49037#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 49036#L15-1 [2020-06-22 05:02:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 14 times [2020-06-22 05:02:27,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:27,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash -303362818, now seen corresponding path program 15 times [2020-06-22 05:02:27,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:27,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash 622859117, now seen corresponding path program 6 times [2020-06-22 05:02:27,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:27,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:27,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:27,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:27,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:27,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:27,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 05:02:27,622 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2020-06-22 05:02:27,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:27,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:27,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:27,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 05:02:28,115 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 60 [2020-06-22 05:02:28,125 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:28,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:28,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:28,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:28,125 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:28,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:28,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:28,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:28,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop [2020-06-22 05:02:28,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:28,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:28,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,193 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:28,193 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:28,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:28,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:28,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:28,228 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:28,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:28,234 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:28,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:28,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:28,278 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:28,304 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:28,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:28,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:28,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:28,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:28,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:28,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:28,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:28,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration21_Loop [2020-06-22 05:02:28,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:28,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:28,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:28,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:28,371 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:28,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:28,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:28,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:28,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:28,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:28,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:28,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:28,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:28,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:28,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:28,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:28,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:28,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:28,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:28,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:28,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:28,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:28,379 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:28,379 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:28,379 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:28,380 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:28,380 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:28,380 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:28,380 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:28,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:28,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:29,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:29,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:30,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:02:30,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:30,600 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 25 predicates after loop cannibalization [2020-06-22 05:02:30,601 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 25 loop predicates [2020-06-22 05:02:30,601 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 149 transitions. cyclomatic complexity: 28 Second operand 9 states. [2020-06-22 05:02:31,223 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 149 transitions. cyclomatic complexity: 28. Second operand 9 states. Result 610 states and 694 transitions. Complement of second has 92 states. [2020-06-22 05:02:31,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 05:02:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2020-06-22 05:02:31,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 4 letters. Loop has 64 letters. [2020-06-22 05:02:31,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:31,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 68 letters. Loop has 64 letters. [2020-06-22 05:02:31,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:31,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 4 letters. Loop has 128 letters. [2020-06-22 05:02:31,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:31,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 694 transitions. [2020-06-22 05:02:31,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:31,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 148 states and 173 transitions. [2020-06-22 05:02:31,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2020-06-22 05:02:31,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2020-06-22 05:02:31,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 173 transitions. [2020-06-22 05:02:31,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:31,232 INFO L706 BuchiCegarLoop]: Abstraction has 148 states and 173 transitions. [2020-06-22 05:02:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 173 transitions. [2020-06-22 05:02:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 123. [2020-06-22 05:02:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2020-06-22 05:02:31,235 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. [2020-06-22 05:02:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 05:02:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 05:02:31,236 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand 9 states. [2020-06-22 05:02:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:31,288 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2020-06-22 05:02:31,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 05:02:31,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 148 transitions. [2020-06-22 05:02:31,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:31,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 148 transitions. [2020-06-22 05:02:31,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:31,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:31,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 148 transitions. [2020-06-22 05:02:31,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:31,292 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. [2020-06-22 05:02:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 148 transitions. [2020-06-22 05:02:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2020-06-22 05:02:31,295 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. [2020-06-22 05:02:31,295 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 148 transitions. [2020-06-22 05:02:31,295 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2020-06-22 05:02:31,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 148 transitions. [2020-06-22 05:02:31,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:31,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:31,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:31,296 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:31,296 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2020-06-22 05:02:31,297 INFO L794 eck$LassoCheckResult]: Stem: 62327#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 62328#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62336#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62338#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 62339#L15-1 [2020-06-22 05:02:31,298 INFO L796 eck$LassoCheckResult]: Loop: 62339#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62445#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62333#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62323#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62324#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62329#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62330#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62444#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62443#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62442#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62441#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62440#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62439#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62437#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62435#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62433#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62431#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62429#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62427#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62425#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62423#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62420#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62421#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62417#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62415#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62416#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62413#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 62343#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62412#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62411#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62410#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62409#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62408#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62407#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62404#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62403#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62401#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62399#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62397#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62395#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62393#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62391#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62389#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62387#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62385#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62383#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62381#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62379#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62377#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62375#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62373#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62371#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62369#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62367#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62365#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62363#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62361#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62359#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62357#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62355#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62353#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62351#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62349#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62348#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 62341#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 62345#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 62342#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 62340#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 62339#L15-1 [2020-06-22 05:02:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 15 times [2020-06-22 05:02:31,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:31,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:31,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash -858336741, now seen corresponding path program 16 times [2020-06-22 05:02:31,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:31,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:31,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:31,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:31,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1137374966, now seen corresponding path program 7 times [2020-06-22 05:02:31,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:31,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:31,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:31,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:31,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 327 proven. 78 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:31,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:31,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:31,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:31,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:31,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 327 proven. 78 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:31,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-06-22 05:02:31,766 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 63 [2020-06-22 05:02:31,773 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:31,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:31,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:31,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:31,774 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:31,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:31,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:31,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:31,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop [2020-06-22 05:02:31,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:31,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:31,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:31,825 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:31,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:31,828 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:31,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:31,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:31,860 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:31,883 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:31,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:31,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:31,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:31,883 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:31,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:31,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:31,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:31,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration22_Loop [2020-06-22 05:02:31,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:31,884 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:31,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:31,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:31,936 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:31,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:31,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:31,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:31,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:31,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:31,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:31,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:31,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:31,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:31,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:31,940 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:31,940 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:31,941 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:31,941 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:31,941 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:31,941 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:31,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:31,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:31,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:31,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:32,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:32,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:33,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:33,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:34,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 05:02:34,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:34,524 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 28 predicates after loop cannibalization [2020-06-22 05:02:34,524 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 28 loop predicates [2020-06-22 05:02:34,525 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 148 transitions. cyclomatic complexity: 27 Second operand 10 states. [2020-06-22 05:02:35,314 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 148 transitions. cyclomatic complexity: 27. Second operand 10 states. Result 642 states and 722 transitions. Complement of second has 104 states. [2020-06-22 05:02:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:02:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2020-06-22 05:02:35,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 86 transitions. Stem has 4 letters. Loop has 68 letters. [2020-06-22 05:02:35,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:35,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 86 transitions. Stem has 72 letters. Loop has 68 letters. [2020-06-22 05:02:35,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:35,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 86 transitions. Stem has 4 letters. Loop has 136 letters. [2020-06-22 05:02:35,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:35,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 642 states and 722 transitions. [2020-06-22 05:02:35,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:35,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 642 states to 152 states and 176 transitions. [2020-06-22 05:02:35,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2020-06-22 05:02:35,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-06-22 05:02:35,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 176 transitions. [2020-06-22 05:02:35,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:35,324 INFO L706 BuchiCegarLoop]: Abstraction has 152 states and 176 transitions. [2020-06-22 05:02:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 176 transitions. [2020-06-22 05:02:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2020-06-22 05:02:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2020-06-22 05:02:35,327 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. [2020-06-22 05:02:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 05:02:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 05:02:35,328 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 10 states. [2020-06-22 05:02:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:35,394 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2020-06-22 05:02:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 05:02:35,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 147 transitions. [2020-06-22 05:02:35,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:35,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 147 transitions. [2020-06-22 05:02:35,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:35,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:35,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 147 transitions. [2020-06-22 05:02:35,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:35,397 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. [2020-06-22 05:02:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 147 transitions. [2020-06-22 05:02:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2020-06-22 05:02:35,400 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. [2020-06-22 05:02:35,400 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 147 transitions. [2020-06-22 05:02:35,400 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2020-06-22 05:02:35,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 147 transitions. [2020-06-22 05:02:35,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:35,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:35,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:35,402 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:35,402 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2020-06-22 05:02:35,402 INFO L794 eck$LassoCheckResult]: Stem: 77265#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 77266#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77274#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77276#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 77273#L15-1 [2020-06-22 05:02:35,403 INFO L796 eck$LassoCheckResult]: Loop: 77273#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77267#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77268#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77261#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77262#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77383#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77382#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77381#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77380#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77379#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77378#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77377#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77376#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77375#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77374#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77373#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77372#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77371#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77370#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77369#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77368#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77366#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77364#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77362#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77360#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77357#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77358#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77354#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77352#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77353#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77350#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 77280#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77349#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77348#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77347#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77346#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77345#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77344#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77341#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77340#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77338#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77336#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77334#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77332#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77330#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77328#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77326#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77324#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77322#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77320#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77318#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77316#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77314#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77312#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77310#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77308#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77306#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77304#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77302#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77300#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77298#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77296#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77294#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77292#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77290#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77288#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77286#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77285#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 77278#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77282#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 77279#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 77277#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 77273#L15-1 [2020-06-22 05:02:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 16 times [2020-06-22 05:02:35,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:35,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash 401653944, now seen corresponding path program 17 times [2020-06-22 05:02:35,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:35,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash 778823719, now seen corresponding path program 8 times [2020-06-22 05:02:35,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:35,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:35,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:35,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:35,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 371 proven. 105 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:35,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:35,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:35,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 05:02:35,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 05:02:35,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:35,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:35,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 371 proven. 105 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-06-22 05:02:35,941 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 67 [2020-06-22 05:02:35,950 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:35,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:35,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:35,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:35,950 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:35,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:35,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:35,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:35,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration23_Loop [2020-06-22 05:02:35,950 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:35,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:35,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:35,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:35,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:35,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:36,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:36,001 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:36,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:36,004 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:36,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:36,030 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:36,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:36,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:36,037 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:36,037 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:36,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:36,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:36,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:02:36,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_21=1} Honda state: {v_rep~unnamed0~0~true_21=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:36,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:36,094 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:36,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:36,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:36,126 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:36,148 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:36,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:36,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:36,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:36,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:36,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:36,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:36,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:36,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration23_Loop [2020-06-22 05:02:36,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:36,149 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:36,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:36,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:36,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:36,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:36,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:36,202 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:36,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:36,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:36,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:36,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:36,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:36,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:36,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:36,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:36,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:36,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:36,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:36,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:36,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:36,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:02:36,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:02:36,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:36,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:36,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:36,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:36,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:36,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:36,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:36,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:36,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:36,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:02:36,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:36,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:36,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:36,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:36,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:36,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:36,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:36,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:36,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:36,215 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:36,215 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:36,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:36,216 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:36,216 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:36,216 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:36,216 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:36,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:36,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:37,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:37,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:38,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:38,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:39,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:39,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:39,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:39,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:39,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:39,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:39,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:39,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:39,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:39,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:39,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 05:02:39,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:39,351 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 31 predicates after loop cannibalization [2020-06-22 05:02:39,351 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 31 loop predicates [2020-06-22 05:02:39,351 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 147 transitions. cyclomatic complexity: 26 Second operand 11 states. [2020-06-22 05:02:40,288 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 147 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 674 states and 750 transitions. Complement of second has 116 states. [2020-06-22 05:02:40,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 05:02:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2020-06-22 05:02:40,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 94 transitions. Stem has 4 letters. Loop has 72 letters. [2020-06-22 05:02:40,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:40,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 94 transitions. Stem has 76 letters. Loop has 72 letters. [2020-06-22 05:02:40,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:40,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 94 transitions. Stem has 4 letters. Loop has 144 letters. [2020-06-22 05:02:40,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:40,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 750 transitions. [2020-06-22 05:02:40,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:40,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 156 states and 179 transitions. [2020-06-22 05:02:40,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2020-06-22 05:02:40,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2020-06-22 05:02:40,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 179 transitions. [2020-06-22 05:02:40,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:40,297 INFO L706 BuchiCegarLoop]: Abstraction has 156 states and 179 transitions. [2020-06-22 05:02:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 179 transitions. [2020-06-22 05:02:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 123. [2020-06-22 05:02:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2020-06-22 05:02:40,300 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. [2020-06-22 05:02:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 05:02:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 05:02:40,301 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand 11 states. [2020-06-22 05:02:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:40,362 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2020-06-22 05:02:40,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 05:02:40,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 146 transitions. [2020-06-22 05:02:40,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:40,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 146 transitions. [2020-06-22 05:02:40,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 05:02:40,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-06-22 05:02:40,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 146 transitions. [2020-06-22 05:02:40,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:40,366 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. [2020-06-22 05:02:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 146 transitions. [2020-06-22 05:02:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-06-22 05:02:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-06-22 05:02:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2020-06-22 05:02:40,369 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. [2020-06-22 05:02:40,369 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 146 transitions. [2020-06-22 05:02:40,369 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2020-06-22 05:02:40,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 146 transitions. [2020-06-22 05:02:40,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:40,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:40,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:40,371 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:02:40,371 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2020-06-22 05:02:40,371 INFO L794 eck$LassoCheckResult]: Stem: 93933#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 93934#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93943#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93944#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 93941#L15-1 [2020-06-22 05:02:40,372 INFO L796 eck$LassoCheckResult]: Loop: 93941#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93935#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93936#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93929#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93930#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94051#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94050#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94049#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94048#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94047#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94046#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94045#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94044#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94043#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94042#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94041#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94040#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94039#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94038#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94037#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94036#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94035#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94034#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94033#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94032#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94031#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94030#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94029#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94027#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94024#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94022#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94023#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94028#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94025#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94018#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 93948#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94017#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94016#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94015#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94014#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94013#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94012#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94009#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94008#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 94006#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 94004#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 94002#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 94000#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93998#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93996#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93994#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93992#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93990#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93988#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93986#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93984#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93982#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93980#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93978#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93976#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93974#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93972#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93970#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93968#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93966#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93964#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93962#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93960#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93958#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93956#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93954#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93953#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 93946#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 93950#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 93947#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 93945#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 93941#L15-1 [2020-06-22 05:02:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2096752, now seen corresponding path program 17 times [2020-06-22 05:02:40,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:40,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:40,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:40,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:40,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1359485141, now seen corresponding path program 18 times [2020-06-22 05:02:40,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:40,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:40,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:40,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -575409980, now seen corresponding path program 9 times [2020-06-22 05:02:40,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:40,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 415 proven. 136 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:40,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:02:40,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:02:40,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 05:02:40,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2020-06-22 05:02:40,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:02:40,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:40,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 415 proven. 136 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:40,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:02:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-06-22 05:02:41,067 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 69 [2020-06-22 05:02:41,075 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:41,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:41,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:41,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:41,075 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:02:41,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:41,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:41,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:41,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration24_Loop [2020-06-22 05:02:41,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:41,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:41,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:41,126 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:41,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:02:41,129 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:02:41,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:02:41,158 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:02:41,161 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:02:41,184 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:02:41,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:02:41,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:02:41,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:02:41,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:02:41,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:02:41,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:02:41,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:02:41,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration24_Loop [2020-06-22 05:02:41,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:02:41,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:02:41,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:02:41,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:02:41,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:02:41,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:02:41,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:02:41,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:02:41,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:02:41,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:02:41,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:02:41,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:02:41,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:02:41,241 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:02:41,242 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:02:41,242 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:02:41,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:02:41,242 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:02:41,243 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:02:41,243 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:02:41,243 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:02:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-06-22 05:02:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:41,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:41,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:42,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:02:42,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:43,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:43,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:02:44,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:02:44,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:02:44,992 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 34 predicates after loop cannibalization [2020-06-22 05:02:44,993 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 34 loop predicates [2020-06-22 05:02:44,993 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 146 transitions. cyclomatic complexity: 25 Second operand 12 states. [2020-06-22 05:02:46,437 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 146 transitions. cyclomatic complexity: 25. Second operand 12 states. Result 706 states and 758 transitions. Complement of second has 200 states. [2020-06-22 05:02:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 1 stem states 30 non-accepting loop states 1 accepting loop states [2020-06-22 05:02:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:02:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 127 transitions. [2020-06-22 05:02:46,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 127 transitions. Stem has 4 letters. Loop has 76 letters. [2020-06-22 05:02:46,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:46,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 127 transitions. Stem has 80 letters. Loop has 76 letters. [2020-06-22 05:02:46,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:46,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 127 transitions. Stem has 4 letters. Loop has 152 letters. [2020-06-22 05:02:46,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:02:46,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 706 states and 758 transitions. [2020-06-22 05:02:46,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:46,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 706 states to 160 states and 172 transitions. [2020-06-22 05:02:46,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-06-22 05:02:46,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2020-06-22 05:02:46,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 172 transitions. [2020-06-22 05:02:46,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:46,447 INFO L706 BuchiCegarLoop]: Abstraction has 160 states and 172 transitions. [2020-06-22 05:02:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 172 transitions. [2020-06-22 05:02:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2020-06-22 05:02:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-06-22 05:02:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2020-06-22 05:02:46,450 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 133 transitions. [2020-06-22 05:02:46,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 05:02:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-06-22 05:02:46,451 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 12 states. [2020-06-22 05:02:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:02:46,535 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2020-06-22 05:02:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 05:02:46,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 185 transitions. [2020-06-22 05:02:46,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:46,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 171 states and 183 transitions. [2020-06-22 05:02:46,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2020-06-22 05:02:46,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2020-06-22 05:02:46,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 183 transitions. [2020-06-22 05:02:46,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:02:46,539 INFO L706 BuchiCegarLoop]: Abstraction has 171 states and 183 transitions. [2020-06-22 05:02:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 183 transitions. [2020-06-22 05:02:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 118. [2020-06-22 05:02:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-06-22 05:02:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2020-06-22 05:02:46,542 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 130 transitions. [2020-06-22 05:02:46,542 INFO L609 BuchiCegarLoop]: Abstraction has 118 states and 130 transitions. [2020-06-22 05:02:46,542 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2020-06-22 05:02:46,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 130 transitions. [2020-06-22 05:02:46,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-06-22 05:02:46,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:02:46,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:02:46,543 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:02:46,543 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2020-06-22 05:02:46,543 INFO L794 eck$LassoCheckResult]: Stem: 112556#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 112557#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112567#L12 [2020-06-22 05:02:46,544 INFO L796 eck$LassoCheckResult]: Loop: 112567#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112569#L12-2 [36] L12-2-->L15-1: Formula: (and (= 0 v_ULTIMATE.start_main_~i~0_10) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 112570#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112576#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112573#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112571#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112572#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112574#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112575#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112605#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112604#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112603#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112602#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112601#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112600#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112599#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112598#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112597#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112596#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112595#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112594#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112593#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112592#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112591#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112590#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112589#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112588#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112587#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112586#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112585#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112584#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112583#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112582#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112581#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112580#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112579#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112578#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112577#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112564#L15-1 [45] L15-1-->L18-1: Formula: (and (= 1 v_ULTIMATE.start_main_~up~0_8) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112565#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112562#L12 [42] L12-->L12-2: Formula: (and (= 10 v_ULTIMATE.start_main_~i~0_8) (= v_ULTIMATE.start_main_~up~0_6 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 112563#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112568#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112558#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112559#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112552#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112553#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112669#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112668#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112667#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112666#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112665#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112664#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112663#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112662#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112661#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112660#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112659#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112658#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112657#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112656#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112655#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112654#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112653#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112652#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112651#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112650#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112649#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112648#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112647#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112646#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112645#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112619#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112618#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112616#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112613#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112614#L12 [56] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 112617#L12-2 [57] L12-2-->L15-1: Formula: (< 0 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 112615#L15-1 [59] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 112606#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 112567#L12 [2020-06-22 05:02:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times [2020-06-22 05:02:46,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:46,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:02:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash 360041138, now seen corresponding path program 19 times [2020-06-22 05:02:46,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:46,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:02:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1103309515, now seen corresponding path program 10 times [2020-06-22 05:02:46,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:02:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:02:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:46,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:02:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:02:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:02:47,033 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 70 [2020-06-22 05:02:47,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:02:47 BasicIcfg [2020-06-22 05:02:47,080 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:02:47,081 INFO L168 Benchmark]: Toolchain (without parser) took 36954.29 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 683.7 MB). Free memory was 565.2 MB in the beginning and 1.0 GB in the end (delta: -458.3 MB). Peak memory consumption was 225.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,082 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:02:47,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.19 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 565.2 MB in the beginning and 641.8 MB in the end (delta: -76.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.59 ms. Allocated memory is still 674.2 MB. Free memory was 641.8 MB in the beginning and 640.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,083 INFO L168 Benchmark]: Boogie Preprocessor took 18.93 ms. Allocated memory is still 674.2 MB. Free memory was 640.4 MB in the beginning and 637.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,083 INFO L168 Benchmark]: RCFGBuilder took 195.41 ms. Allocated memory is still 674.2 MB. Free memory was 637.3 MB in the beginning and 623.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,083 INFO L168 Benchmark]: BlockEncodingV2 took 77.05 ms. Allocated memory is still 674.2 MB. Free memory was 623.3 MB in the beginning and 617.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,084 INFO L168 Benchmark]: TraceAbstraction took 150.25 ms. Allocated memory is still 674.2 MB. Free memory was 617.9 MB in the beginning and 608.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,084 INFO L168 Benchmark]: BuchiAutomizer took 36189.84 ms. Allocated memory was 674.2 MB in the beginning and 1.3 GB in the end (delta: 659.0 MB). Free memory was 608.4 MB in the beginning and 1.0 GB in the end (delta: -415.2 MB). Peak memory consumption was 243.9 MB. Max. memory is 50.3 GB. [2020-06-22 05:02:47,087 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 283.19 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 565.2 MB in the beginning and 641.8 MB in the end (delta: -76.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.59 ms. Allocated memory is still 674.2 MB. Free memory was 641.8 MB in the beginning and 640.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.93 ms. Allocated memory is still 674.2 MB. Free memory was 640.4 MB in the beginning and 637.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 195.41 ms. Allocated memory is still 674.2 MB. Free memory was 637.3 MB in the beginning and 623.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 77.05 ms. Allocated memory is still 674.2 MB. Free memory was 623.3 MB in the beginning and 617.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 150.25 ms. Allocated memory is still 674.2 MB. Free memory was 617.9 MB in the beginning and 608.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 36189.84 ms. Allocated memory was 674.2 MB in the beginning and 1.3 GB in the end (delta: 659.0 MB). Free memory was 608.4 MB in the beginning and 1.0 GB in the end (delta: -415.2 MB). Peak memory consumption was 243.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 34 terminating modules (22 trivial, 0 deterministic, 12 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 7 locations. One nondeterministic module has affine ranking function up and consists of 5 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function i and consists of 11 locations. One nondeterministic module has affine ranking function i and consists of 13 locations. One nondeterministic module has affine ranking function i and consists of 15 locations. One nondeterministic module has affine ranking function i and consists of 17 locations. One nondeterministic module has affine ranking function i and consists of 19 locations. One nondeterministic module has affine ranking function i and consists of 21 locations. One nondeterministic module has affine ranking function i and consists of 23 locations. One nondeterministic module has affine ranking function i and consists of 33 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 118 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.1s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 9.2s. Construction of modules took 1.8s. Büchi inclusion checks took 24.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 32. Automata minimization 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 360 StatesRemovedByMinimization, 25 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 123 states and ocurred in iteration 15. Nontrivial modules had stage [12, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1701/3904 HoareTripleCheckerStatistics: 164 SDtfs, 1149 SDslu, 30 SDs, 0 SdLazy, 2585 SolverSat, 489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT2 conc0 concLT10 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax180 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf89 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1891b0d7=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 05:02:06.901 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:02:47.332 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check