YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 00:00:41,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 00:00:41,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 00:00:41,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 00:00:41,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 00:00:41,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 00:00:41,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 00:00:41,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 00:00:41,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 00:00:41,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 00:00:41,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 00:00:41,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 00:00:41,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 00:00:41,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 00:00:41,697 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 00:00:41,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 00:00:41,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 00:00:41,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 00:00:41,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 00:00:41,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 00:00:41,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 00:00:41,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 00:00:41,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 00:00:41,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 00:00:41,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 00:00:41,709 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 00:00:41,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 00:00:41,710 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 00:00:41,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 00:00:41,711 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 00:00:41,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 00:00:41,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 00:00:41,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 00:00:41,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 00:00:41,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 00:00:41,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 00:00:41,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 00:00:41,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 00:00:41,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 00:00:41,716 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 00:00:41,731 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 00:00:41,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 00:00:41,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 00:00:41,732 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 00:00:41,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 00:00:41,732 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 00:00:41,733 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 00:00:41,733 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 00:00:41,733 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 00:00:41,733 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 00:00:41,733 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 00:00:41,734 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 00:00:41,734 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 00:00:41,734 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 00:00:41,734 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:41,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 00:00:41,734 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 00:00:41,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 00:00:41,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 00:00:41,735 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 00:00:41,735 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 00:00:41,735 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 00:00:41,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 00:00:41,736 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 00:00:41,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 00:00:41,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 00:00:41,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 00:00:41,736 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 00:00:41,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 00:00:41,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 00:00:41,774 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 00:00:41,778 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 00:00:41,779 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 00:00:41,779 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 00:00:41,780 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 00:00:41,845 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/a9389f8afc0f4fcebb4d40df29b18da2/FLAG027d3a80d [2020-06-22 00:00:42,189 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 00:00:42,190 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 00:00:42,197 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/a9389f8afc0f4fcebb4d40df29b18da2/FLAG027d3a80d [2020-06-22 00:00:42,600 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/a9389f8afc0f4fcebb4d40df29b18da2 [2020-06-22 00:00:42,612 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 00:00:42,614 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 00:00:42,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 00:00:42,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 00:00:42,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 00:00:42,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c73c74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42, skipping insertion in model container [2020-06-22 00:00:42,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 00:00:42,647 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 00:00:42,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 00:00:42,805 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 00:00:42,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 00:00:42,889 INFO L195 MainTranslator]: Completed translation [2020-06-22 00:00:42,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42 WrapperNode [2020-06-22 00:00:42,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 00:00:42,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 00:00:42,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 00:00:42,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 00:00:42,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 00:00:42,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 00:00:42,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 00:00:42,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 00:00:42,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (1/1) ... [2020-06-22 00:00:42,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 00:00:42,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 00:00:42,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 00:00:42,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 00:00:42,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (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 00:00:43,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 00:00:43,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 00:00:43,149 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 00:00:43,150 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 00:00:43,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:00:43 BoogieIcfgContainer [2020-06-22 00:00:43,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 00:00:43,152 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 00:00:43,152 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 00:00:43,154 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 00:00:43,155 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:00:43" (1/1) ... [2020-06-22 00:00:43,169 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-06-22 00:00:43,171 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 00:00:43,171 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 00:00:43,172 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 00:00:43,172 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 00:00:43,174 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 00:00:43,175 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 00:00:43,175 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 00:00:43,191 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 00:00:43,207 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 00:00:43,212 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 00:00:43,213 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 00:00:43,224 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 00:00:43,226 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 00:00:43,227 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 00:00:43,228 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 00:00:43,228 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 00:00:43,228 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 00:00:43,228 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-06-22 00:00:43,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:00:43 BasicIcfg [2020-06-22 00:00:43,229 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 00:00:43,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 00:00:43,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 00:00:43,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 00:00:43,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 12:00:42" (1/4) ... [2020-06-22 00:00:43,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fad4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (2/4) ... [2020-06-22 00:00:43,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fad4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:00:43" (3/4) ... [2020-06-22 00:00:43,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fad4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:00:43" (4/4) ... [2020-06-22 00:00:43,237 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 00:00:43,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 00:00:43,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 00:00:43,273 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 00:00:43,301 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 00:00:43,302 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 00:00:43,302 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 00:00:43,302 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 00:00:43,303 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 00:00:43,303 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 00:00:43,303 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 00:00:43,303 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 00:00:43,303 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 00:00:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 00:00:43,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 00:00:43,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 00:00:43,374 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 00:00:43,374 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 30) no Hoare annotation was computed. [2020-06-22 00:00:43,374 INFO L451 ceAbstractionStarter]: At program point L27-2(lines 19 32) the Hoare annotation is: true [2020-06-22 00:00:43,374 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-06-22 00:00:43,375 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 31) no Hoare annotation was computed. [2020-06-22 00:00:43,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:00:43 BasicIcfg [2020-06-22 00:00:43,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 00:00:43,384 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 00:00:43,384 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 00:00:43,387 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 00:00:43,388 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:00:43,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 12:00:42" (1/5) ... [2020-06-22 00:00:43,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c21007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:00:43,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 12:00:42" (2/5) ... [2020-06-22 00:00:43,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c21007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:00:43,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:00:43" (3/5) ... [2020-06-22 00:00:43,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c21007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:00:43,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 12:00:43" (4/5) ... [2020-06-22 00:00:43,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c21007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:00:43, skipping insertion in model container [2020-06-22 00:00:43,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 00:00:43,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:00:43" (5/5) ... [2020-06-22 00:00:43,392 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 00:00:43,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 00:00:43,418 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 00:00:43,418 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 00:00:43,418 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 00:00:43,418 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 00:00:43,418 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 00:00:43,418 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 00:00:43,419 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 00:00:43,419 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 00:00:43,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 00:00:43,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 00:00:43,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:43,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:43,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 00:00:43,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:00:43,446 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 00:00:43,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 00:00:43,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 00:00:43,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:43,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:43,447 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 00:00:43,448 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:00:43,453 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 6#L27-2true [2020-06-22 00:00:43,453 INFO L796 eck$LassoCheckResult]: Loop: 6#L27-2true [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 7#L20true [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 4#L27true [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 6#L27-2true [2020-06-22 00:00:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times [2020-06-22 00:00:43,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:43,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:43,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:43,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:43,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash 74778, now seen corresponding path program 1 times [2020-06-22 00:00:43,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:43,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:43,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:43,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:43,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2011193, now seen corresponding path program 1 times [2020-06-22 00:00:43,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:43,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:43,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:43,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:43,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:43,625 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:43,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:43,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:43,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:43,627 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:00:43,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:43,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:43,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:43,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 00:00:43,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:43,628 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:43,647 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 00:00:43,656 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 00:00:43,661 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 00:00:43,664 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 00:00:43,668 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 00:00:43,673 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 00:00:43,801 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:43,801 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 00:00:43,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:43,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:43,841 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:43,842 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=-1} Honda state: {ULTIMATE.start_main_~b~0=-1} 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 00:00:43,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:43,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:43,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:43,876 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 00:00:43,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:43,881 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:43,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:43,908 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 00:00:43,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:43,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:43,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:43,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 00:00:43,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:43,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:43,975 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:43,975 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 00:00:43,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:43,983 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 00:00:44,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:00:44,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:44,050 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:00:44,052 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:44,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:44,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:44,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:44,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:00:44,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:00:44,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:44,053 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:44,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 00:00:44,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:44,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:44,055 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 00:00:44,060 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 00:00:44,064 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 00:00:44,070 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 00:00:44,079 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 00:00:44,083 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 00:00:44,160 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:44,166 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:00:44,168 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 00:00:44,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:44,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:44,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:44,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:44,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:44,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:44,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:44,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:44,177 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 00:00:44,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:44,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:44,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:44,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:44,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:00:44,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:00:44,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:44,187 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 00:00:44,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:44,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:44,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:44,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:44,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:44,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:44,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:44,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:44,191 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 00:00:44,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:44,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:44,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:44,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:44,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:00:44,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:00:44,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:44,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 00:00:44,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:44,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:44,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:44,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:44,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:44,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:44,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:44,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:44,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 00:00:44,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:44,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:44,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:44,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:44,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:44,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:44,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:44,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:00:44,221 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:00:44,221 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 00:00:44,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:00:44,224 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:00:44,224 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:00:44,224 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 00:00:44,226 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:00:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:44,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:00:44,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:44,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:44,343 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 00:00:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:44,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:44,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:44,380 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:00:44,385 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 00:00:44,386 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. [2020-06-22 00:00:44,449 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 8 states. [2020-06-22 00:00:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 00:00:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 00:00:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 00:00:44,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 00:00:44,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:44,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 00:00:44,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:44,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 00:00:44,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:44,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. [2020-06-22 00:00:44,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 00:00:44,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 32 transitions. [2020-06-22 00:00:44,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 00:00:44,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 00:00:44,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 32 transitions. [2020-06-22 00:00:44,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:44,475 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 32 transitions. [2020-06-22 00:00:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 32 transitions. [2020-06-22 00:00:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2020-06-22 00:00:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 00:00:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2020-06-22 00:00:44,507 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 00:00:44,507 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 00:00:44,507 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 00:00:44,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. [2020-06-22 00:00:44,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 00:00:44,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:44,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:44,509 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:00:44,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:00:44,510 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 73#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 82#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 79#L22 [2020-06-22 00:00:44,510 INFO L796 eck$LassoCheckResult]: Loop: 79#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 75#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 80#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 79#L22 [2020-06-22 00:00:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 1 times [2020-06-22 00:00:44,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:44,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:44,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:44,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash 68711, now seen corresponding path program 1 times [2020-06-22 00:00:44,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:44,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:44,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1932491717, now seen corresponding path program 1 times [2020-06-22 00:00:44,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:44,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:44,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:44,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:44,587 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:44,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:44,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:44,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:44,588 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:00:44,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:44,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:44,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:44,588 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 00:00:44,588 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:44,588 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:44,590 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 00:00:44,595 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 00:00:44,600 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 00:00:44,605 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 00:00:44,609 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 00:00:44,618 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 00:00:44,701 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:44,702 INFO L412 LassoAnalysis]: Checking for nontermination... 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 00:00:44,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:44,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:44,736 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:44,736 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 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 00:00:44,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:44,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:44,748 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:44,748 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=0} Honda state: {ULTIMATE.start_main_~b~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 00:00:44,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:44,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:44,811 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:44,811 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:44,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:44,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:44,850 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:44,850 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:44,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:44,856 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 00:00:44,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:00:44,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:44,938 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:00:44,940 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:44,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:44,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:44,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:44,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:00:44,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:00:44,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:44,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:44,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 00:00:44,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:44,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:44,944 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 00:00:44,950 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 00:00:44,956 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 00:00:44,962 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 00:00:44,971 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 00:00:44,975 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 00:00:45,061 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:45,061 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:00:45,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 00:00:45,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:45,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:45,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:45,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:45,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:00:45,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:00:45,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:45,070 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 00:00:45,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:45,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:45,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:45,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:45,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:45,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:45,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:45,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:45,074 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 00:00:45,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:45,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:45,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:45,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:45,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:45,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:45,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:45,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:45,076 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 00:00:45,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:45,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:45,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:45,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:45,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:45,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:45,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:45,082 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:00:45,086 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:00:45,087 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 00:00:45,087 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:00:45,088 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:00:45,088 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:00:45,088 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 00:00:45,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:00:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,134 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 00:00:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,181 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:00:45,181 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 00:00:45,181 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 24 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-06-22 00:00:45,240 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 24 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 19 states and 46 transitions. Complement of second has 8 states. [2020-06-22 00:00:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 00:00:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 00:00:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 00:00:45,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 00:00:45,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:45,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 00:00:45,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:45,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 00:00:45,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:45,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 46 transitions. [2020-06-22 00:00:45,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 00:00:45,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 38 transitions. [2020-06-22 00:00:45,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 00:00:45,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 00:00:45,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 38 transitions. [2020-06-22 00:00:45,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:45,248 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 38 transitions. [2020-06-22 00:00:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 38 transitions. [2020-06-22 00:00:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 00:00:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 00:00:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2020-06-22 00:00:45,251 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 38 transitions. [2020-06-22 00:00:45,251 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 38 transitions. [2020-06-22 00:00:45,251 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 00:00:45,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 38 transitions. [2020-06-22 00:00:45,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 00:00:45,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:45,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:45,253 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:00:45,253 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2020-06-22 00:00:45,253 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 155#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 167#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 161#L22 [2020-06-22 00:00:45,254 INFO L796 eck$LassoCheckResult]: Loop: 161#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 163#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 165#L20 [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 156#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 157#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 168#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 161#L22 [2020-06-22 00:00:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 2 times [2020-06-22 00:00:45,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2047274518, now seen corresponding path program 1 times [2020-06-22 00:00:45,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:00:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:00:45,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 00:00:45,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 00:00:45,307 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 00:00:45,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 00:00:45,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 00:00:45,310 INFO L87 Difference]: Start difference. First operand 16 states and 38 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-06-22 00:00:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 00:00:45,337 INFO L93 Difference]: Finished difference Result 24 states and 52 transitions. [2020-06-22 00:00:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 00:00:45,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 52 transitions. [2020-06-22 00:00:45,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 00:00:45,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 50 transitions. [2020-06-22 00:00:45,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 00:00:45,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 00:00:45,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 50 transitions. [2020-06-22 00:00:45,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:45,342 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 50 transitions. [2020-06-22 00:00:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 50 transitions. [2020-06-22 00:00:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 00:00:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 00:00:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 50 transitions. [2020-06-22 00:00:45,345 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 50 transitions. [2020-06-22 00:00:45,345 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 50 transitions. [2020-06-22 00:00:45,345 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 00:00:45,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 50 transitions. [2020-06-22 00:00:45,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 00:00:45,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:45,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:45,347 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:00:45,348 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2020-06-22 00:00:45,348 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 201#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 213#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 209#L22 [2020-06-22 00:00:45,348 INFO L796 eck$LassoCheckResult]: Loop: 209#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 211#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 219#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 218#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 204#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 217#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 209#L22 [2020-06-22 00:00:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 3 times [2020-06-22 00:00:45,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2047304309, now seen corresponding path program 1 times [2020-06-22 00:00:45,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:00:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:00:45,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 00:00:45,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 00:00:45,374 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 00:00:45,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 00:00:45,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 00:00:45,374 INFO L87 Difference]: Start difference. First operand 22 states and 50 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-06-22 00:00:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 00:00:45,394 INFO L93 Difference]: Finished difference Result 32 states and 58 transitions. [2020-06-22 00:00:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 00:00:45,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 58 transitions. [2020-06-22 00:00:45,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 00:00:45,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 51 transitions. [2020-06-22 00:00:45,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 00:00:45,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 00:00:45,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 51 transitions. [2020-06-22 00:00:45,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:45,399 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-06-22 00:00:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 51 transitions. [2020-06-22 00:00:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-06-22 00:00:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 00:00:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 49 transitions. [2020-06-22 00:00:45,402 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 49 transitions. [2020-06-22 00:00:45,420 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 49 transitions. [2020-06-22 00:00:45,420 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 00:00:45,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 49 transitions. [2020-06-22 00:00:45,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 00:00:45,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:45,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:45,424 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 00:00:45,424 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2020-06-22 00:00:45,425 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 261#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 275#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 269#L22 [2020-06-22 00:00:45,425 INFO L796 eck$LassoCheckResult]: Loop: 269#L22 [57] L22-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~b~0_7 1)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~b~0] 263#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 273#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 262#L27 [59] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_9 0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1))) (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 264#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 279#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 269#L22 [2020-06-22 00:00:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 4 times [2020-06-22 00:00:45,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1732317127, now seen corresponding path program 1 times [2020-06-22 00:00:45,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:00:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1634786331, now seen corresponding path program 1 times [2020-06-22 00:00:45,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:45,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:45,533 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:45,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:45,533 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:45,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:45,534 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:00:45,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:45,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:45,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:45,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 00:00:45,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:45,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:45,536 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 00:00:45,539 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 00:00:45,545 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 00:00:45,548 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 00:00:45,550 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 00:00:45,552 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 00:00:45,559 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 00:00:45,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:45,629 INFO L412 LassoAnalysis]: Checking for nontermination... 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 00:00:45,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:45,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:45,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:45,667 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-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 00:00:45,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:45,672 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 00:00:45,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:00:45,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:45,762 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:00:45,764 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:45,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:45,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:45,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:45,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:00:45,764 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:00:45,764 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:45,764 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:45,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 00:00:45,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:45,765 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:45,766 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 00:00:45,770 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 00:00:45,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 00:00:45,778 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 00:00:45,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 00:00:45,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 00:00:45,789 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 00:00:45,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:45,850 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:00:45,850 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 00:00:45,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:45,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:45,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:45,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:45,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:45,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:45,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:45,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:45,854 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 00:00:45,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:45,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:45,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:45,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:45,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:45,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:45,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:45,859 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:00:45,861 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:00:45,861 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 00:00:45,862 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:00:45,862 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:00:45,862 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:00:45,862 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 00:00:45,862 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:00:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:00:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:45,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:45,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:45,992 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:00:45,992 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 00:00:45,993 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 49 transitions. cyclomatic complexity: 25 Second operand 5 states. [2020-06-22 00:00:46,043 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 49 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 60 states and 107 transitions. Complement of second has 12 states. [2020-06-22 00:00:46,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 00:00:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 00:00:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 00:00:46,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 00:00:46,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 00:00:46,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 12 letters. [2020-06-22 00:00:46,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 107 transitions. [2020-06-22 00:00:46,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:00:46,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 91 transitions. [2020-06-22 00:00:46,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 00:00:46,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 00:00:46,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 91 transitions. [2020-06-22 00:00:46,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:46,052 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 91 transitions. [2020-06-22 00:00:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 91 transitions. [2020-06-22 00:00:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2020-06-22 00:00:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 00:00:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 76 transitions. [2020-06-22 00:00:46,056 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 76 transitions. [2020-06-22 00:00:46,056 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 76 transitions. [2020-06-22 00:00:46,056 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 00:00:46,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 76 transitions. [2020-06-22 00:00:46,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:00:46,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:46,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:46,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 00:00:46,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:00:46,058 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 451#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 464#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 465#L22 [58] L22-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~b~0_7 1)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~b~0] 453#L27-2 [2020-06-22 00:00:46,058 INFO L796 eck$LassoCheckResult]: Loop: 453#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 470#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 452#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 453#L27-2 [2020-06-22 00:00:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2010935, now seen corresponding path program 1 times [2020-06-22 00:00:46,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash 74809, now seen corresponding path program 1 times [2020-06-22 00:00:46,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash -221732541, now seen corresponding path program 1 times [2020-06-22 00:00:46,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:46,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,104 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:46,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:46,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:46,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:46,105 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:00:46,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:46,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:46,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 00:00:46,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:46,106 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:46,107 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 00:00:46,109 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 00:00:46,121 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 00:00:46,123 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 00:00:46,126 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 00:00:46,128 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 00:00:46,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:46,177 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:46,184 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,211 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:00:46,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,272 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:00:46,274 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:46,274 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:46,274 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:46,274 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:46,274 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:00:46,274 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:00:46,274 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:46,274 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:46,274 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 00:00:46,274 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:46,275 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:46,276 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 00:00:46,279 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 00:00:46,285 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 00:00:46,287 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 00:00:46,289 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 00:00:46,291 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 00:00:46,337 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:46,338 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:00:46,338 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 00:00:46,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:46,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:46,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:46,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:46,341 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 00:00:46,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:46,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:46,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:46,345 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:00:46,348 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:00:46,348 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 00:00:46,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:00:46,348 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:00:46,349 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:00:46,349 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 00:00:46,349 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:00:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:46,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:00:46,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:46,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:46,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:46,400 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 00:00:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:46,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:46,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:46,417 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:00:46,418 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 00:00:46,418 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 76 transitions. cyclomatic complexity: 42 Second operand 4 states. [2020-06-22 00:00:46,464 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 76 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 110 states and 176 transitions. Complement of second has 14 states. [2020-06-22 00:00:46,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 00:00:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 00:00:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 00:00:46,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 00:00:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 00:00:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 00:00:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 176 transitions. [2020-06-22 00:00:46,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:00:46,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 68 states and 121 transitions. [2020-06-22 00:00:46,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 00:00:46,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 00:00:46,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 121 transitions. [2020-06-22 00:00:46,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:46,472 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 121 transitions. [2020-06-22 00:00:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 121 transitions. [2020-06-22 00:00:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2020-06-22 00:00:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 00:00:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 93 transitions. [2020-06-22 00:00:46,477 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 93 transitions. [2020-06-22 00:00:46,477 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 93 transitions. [2020-06-22 00:00:46,477 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 00:00:46,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 93 transitions. [2020-06-22 00:00:46,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:00:46,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:46,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:46,478 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 00:00:46,479 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:00:46,479 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 661#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 685#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 708#L22 [57] L22-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~b~0_7 1)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~b~0] 663#L27-2 [2020-06-22 00:00:46,479 INFO L796 eck$LassoCheckResult]: Loop: 663#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 683#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 662#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 663#L27-2 [2020-06-22 00:00:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2010934, now seen corresponding path program 1 times [2020-06-22 00:00:46,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 74809, now seen corresponding path program 2 times [2020-06-22 00:00:46,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash -221762332, now seen corresponding path program 1 times [2020-06-22 00:00:46,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 00:00:46,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:46,528 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:46,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:46,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:46,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:46,529 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:00:46,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:46,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:46,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 00:00:46,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:46,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:46,531 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 00:00:46,533 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 00:00:46,536 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 00:00:46,538 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 00:00:46,540 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 00:00:46,547 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 00:00:46,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:46,590 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:46,597 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,650 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:46,650 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,654 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:46,680 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,684 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:46,710 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:46,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:46,714 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 00:00:46,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:00:46,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:46,773 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:00:46,775 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:46,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:46,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:46,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:46,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:00:46,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:00:46,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:46,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:46,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 00:00:46,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:46,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:46,777 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 00:00:46,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 00:00:46,782 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 00:00:46,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 00:00:46,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 00:00:46,793 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 00:00:46,840 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:46,840 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:00:46,841 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 00:00:46,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:46,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:46,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:46,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:46,845 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 00:00:46,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:00:46,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:00:46,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:46,850 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 00:00:46,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:00:46,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:00:46,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:46,855 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 00:00:46,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:46,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:46,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:46,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:46,857 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 00:00:46,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:46,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:46,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:46,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:46,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:46,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:46,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:46,861 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:00:46,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:00:46,863 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 00:00:46,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:00:46,864 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:00:46,864 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:00:46,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 00:00:46,864 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:00:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:46,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:00:46,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:46,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:46,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:46,909 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 00:00:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:46,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:46,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:46,927 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:00:46,927 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 00:00:46,927 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 93 transitions. cyclomatic complexity: 49 Second operand 4 states. [2020-06-22 00:00:46,972 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 93 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 116 states and 186 transitions. Complement of second has 14 states. [2020-06-22 00:00:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 00:00:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 00:00:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 00:00:46,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 00:00:46,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 00:00:46,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 00:00:46,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:46,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 186 transitions. [2020-06-22 00:00:46,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:00:46,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 76 states and 134 transitions. [2020-06-22 00:00:46,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 00:00:46,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 00:00:46,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 134 transitions. [2020-06-22 00:00:46,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:46,979 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 134 transitions. [2020-06-22 00:00:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 134 transitions. [2020-06-22 00:00:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2020-06-22 00:00:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 00:00:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2020-06-22 00:00:46,985 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. [2020-06-22 00:00:46,985 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. [2020-06-22 00:00:46,985 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 00:00:46,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 90 transitions. [2020-06-22 00:00:46,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 00:00:46,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 00:00:46,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 00:00:46,987 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 00:00:46,987 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 00:00:46,987 INFO L794 eck$LassoCheckResult]: Stem: 886#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 887#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 901#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 925#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 896#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 908#L20 [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 888#L27 [2020-06-22 00:00:46,988 INFO L796 eck$LassoCheckResult]: Loop: 888#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 889#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 907#L20 [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 888#L27 [2020-06-22 00:00:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1932491726, now seen corresponding path program 1 times [2020-06-22 00:00:46,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 00:00:47,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 00:00:47,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 00:00:47,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 00:00:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash 66798, now seen corresponding path program 2 times [2020-06-22 00:00:47,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 00:00:47,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 00:00:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 00:00:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 00:00:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 00:00:47,031 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:47,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:47,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:47,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:47,031 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 00:00:47,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:47,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:47,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:47,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 00:00:47,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:47,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:47,033 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 00:00:47,037 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 00:00:47,040 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 00:00:47,047 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 00:00:47,049 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 00:00:47,051 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 00:00:47,099 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:47,099 INFO L412 LassoAnalysis]: Checking for nontermination... 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 00:00:47,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:47,106 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:47,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:47,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 00:00:47,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:47,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:47,168 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 00:00:47,168 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 00:00:47,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 00:00:47,174 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 00:00:47,203 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 00:00:47,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 00:00:47,235 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 00:00:47,236 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 00:00:47,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 00:00:47,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 00:00:47,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 00:00:47,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 00:00:47,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 00:00:47,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 00:00:47,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 00:00:47,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 00:00:47,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 00:00:47,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 00:00:47,239 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 00:00:47,243 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 00:00:47,251 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 00:00:47,254 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 00:00:47,256 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 00:00:47,259 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 00:00:47,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 00:00:47,312 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 00:00:47,312 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 00:00:47,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:47,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:47,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:47,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:47,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 00:00:47,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 00:00:47,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 00:00:47,319 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 00:00:47,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 00:00:47,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 00:00:47,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 00:00:47,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 00:00:47,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 00:00:47,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 00:00:47,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 00:00:47,323 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 00:00:47,324 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 00:00:47,324 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 00:00:47,325 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 00:00:47,325 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 00:00:47,325 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 00:00:47,325 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 00:00:47,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 00:00:47,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 00:00:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:47,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 00:00:47,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:47,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:47,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:47,360 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 00:00:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 00:00:47,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 00:00:47,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 00:00:47,387 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 00:00:47,387 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 00:00:47,388 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46 Second operand 4 states. [2020-06-22 00:00:47,448 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46. Second operand 4 states. Result 137 states and 237 transitions. Complement of second has 8 states. [2020-06-22 00:00:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 00:00:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 00:00:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-06-22 00:00:47,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 00:00:47,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:47,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 00:00:47,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:47,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 00:00:47,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 00:00:47,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 237 transitions. [2020-06-22 00:00:47,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 00:00:47,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 83 states and 152 transitions. [2020-06-22 00:00:47,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 00:00:47,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 00:00:47,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 152 transitions. [2020-06-22 00:00:47,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 00:00:47,474 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 152 transitions. [2020-06-22 00:00:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 152 transitions. [2020-06-22 00:00:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 41. [2020-06-22 00:00:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 00:00:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 78 transitions. [2020-06-22 00:00:47,478 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 78 transitions. [2020-06-22 00:00:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 00:00:47,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 00:00:47,478 INFO L87 Difference]: Start difference. First operand 41 states and 78 transitions. Second operand 3 states. [2020-06-22 00:00:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 00:00:47,495 INFO L93 Difference]: Finished difference Result 33 states and 54 transitions. [2020-06-22 00:00:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 00:00:47,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 54 transitions. [2020-06-22 00:00:47,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 00:00:47,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-06-22 00:00:47,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 00:00:47,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 00:00:47,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 00:00:47,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 00:00:47,499 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:00:47,499 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:00:47,499 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 00:00:47,499 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 00:00:47,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 00:00:47,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 00:00:47,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 00:00:47,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 12:00:47 BasicIcfg [2020-06-22 00:00:47,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 00:00:47,506 INFO L168 Benchmark]: Toolchain (without parser) took 4893.39 ms. Allocated memory was 649.6 MB in the beginning and 780.1 MB in the end (delta: 130.5 MB). Free memory was 560.8 MB in the beginning and 737.8 MB in the end (delta: -177.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 00:00:47,507 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 00:00:47,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.44 ms. Allocated memory was 649.6 MB in the beginning and 708.8 MB in the end (delta: 59.2 MB). Free memory was 559.7 MB in the beginning and 675.7 MB in the end (delta: -116.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 00:00:47,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 708.8 MB. Free memory was 675.7 MB in the beginning and 672.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 00:00:47,509 INFO L168 Benchmark]: Boogie Preprocessor took 19.06 ms. Allocated memory is still 708.8 MB. Free memory was 672.9 MB in the beginning and 671.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 00:00:47,509 INFO L168 Benchmark]: RCFGBuilder took 206.89 ms. Allocated memory is still 708.8 MB. Free memory was 671.8 MB in the beginning and 657.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-06-22 00:00:47,510 INFO L168 Benchmark]: BlockEncodingV2 took 77.44 ms. Allocated memory is still 708.8 MB. Free memory was 657.0 MB in the beginning and 650.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. [2020-06-22 00:00:47,510 INFO L168 Benchmark]: TraceAbstraction took 153.41 ms. Allocated memory is still 708.8 MB. Free memory was 650.3 MB in the beginning and 641.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 00:00:47,511 INFO L168 Benchmark]: BuchiAutomizer took 4121.47 ms. Allocated memory was 708.8 MB in the beginning and 780.1 MB in the end (delta: 71.3 MB). Free memory was 641.6 MB in the beginning and 737.8 MB in the end (delta: -96.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 00:00:47,514 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.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 275.44 ms. Allocated memory was 649.6 MB in the beginning and 708.8 MB in the end (delta: 59.2 MB). Free memory was 559.7 MB in the beginning and 675.7 MB in the end (delta: -116.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 708.8 MB. Free memory was 675.7 MB in the beginning and 672.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.06 ms. Allocated memory is still 708.8 MB. Free memory was 672.9 MB in the beginning and 671.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 206.89 ms. Allocated memory is still 708.8 MB. Free memory was 671.8 MB in the beginning and 657.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 77.44 ms. Allocated memory is still 708.8 MB. Free memory was 657.0 MB in the beginning and 650.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.41 ms. Allocated memory is still 708.8 MB. Free memory was 650.3 MB in the beginning and 641.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4121.47 ms. Allocated memory was 708.8 MB in the beginning and 780.1 MB in the end (delta: 71.3 MB). Free memory was 641.6 MB in the beginning and 737.8 MB in the end (delta: -96.2 MB). There was no memory consumed. 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: 19]: 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 9 terminating modules (3 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 106 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 6. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 63 SDtfs, 121 SDslu, 103 SDs, 0 SdLazy, 264 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 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: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 00:00:39.326 ----------------------------------------------- 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 00:00:47.747 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check