YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:16:08,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:16:08,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:16:08,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:16:08,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:16:08,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:16:08,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:16:08,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:16:08,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:16:08,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:16:08,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:16:08,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:16:08,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:16:08,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:16:08,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:16:08,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:16:08,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:16:08,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:16:08,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:16:08,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:16:08,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:16:08,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:16:08,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:16:08,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:16:08,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:16:08,115 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:16:08,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:16:08,116 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:16:08,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:16:08,117 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:16:08,118 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:16:08,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:16:08,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:16:08,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:16:08,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:16:08,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:16:08,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:16:08,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:16:08,122 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:16:08,122 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 04:16:08,136 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:16:08,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:16:08,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:16:08,138 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:16:08,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:16:08,138 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:16:08,138 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:16:08,138 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:16:08,139 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:08,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:16:08,140 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:16:08,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:16:08,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:16:08,140 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:16:08,140 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:16:08,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:16:08,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:16:08,141 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:16:08,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:16:08,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:16:08,141 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:16:08,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:16:08,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:16:08,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:16:08,180 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:16:08,184 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:16:08,185 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:16:08,185 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:16:08,186 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:16:08,249 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/4a9943a2c3414cdcb46eb4b82f20f6b1/FLAG8d7d04f3b [2020-06-22 04:16:08,593 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:16:08,593 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:16:08,600 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/4a9943a2c3414cdcb46eb4b82f20f6b1/FLAG8d7d04f3b [2020-06-22 04:16:09,002 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/4a9943a2c3414cdcb46eb4b82f20f6b1 [2020-06-22 04:16:09,018 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:16:09,020 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:16:09,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:16:09,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:16:09,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:16:09,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755bae8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:16:09,063 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:16:09,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:16:09,233 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:16:09,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:16:09,337 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:16:09,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09 WrapperNode [2020-06-22 04:16:09,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:16:09,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:16:09,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:16:09,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:16:09,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:16:09,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:16:09,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:16:09,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:16:09,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:16:09,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:16:09,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:16:09,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:16:09,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (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 04:16:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:16:09,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:16:09,618 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:16:09,618 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 04:16:09,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:16:09 BoogieIcfgContainer [2020-06-22 04:16:09,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:16:09,620 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:16:09,620 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:16:09,622 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:16:09,623 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:16:09" (1/1) ... [2020-06-22 04:16:09,637 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-06-22 04:16:09,639 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:16:09,640 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:16:09,640 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:16:09,641 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:16:09,643 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:16:09,644 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:16:09,644 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:16:09,662 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:16:09,679 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 04:16:09,684 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 04:16:09,690 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:16:09,701 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 04:16:09,703 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 04:16:09,705 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:16:09,705 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:16:09,705 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:16:09,705 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:16:09,706 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-06-22 04:16:09,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:16:09 BasicIcfg [2020-06-22 04:16:09,706 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:16:09,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:16:09,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:16:09,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:16:09,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:16:09" (1/4) ... [2020-06-22 04:16:09,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c2d537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (2/4) ... [2020-06-22 04:16:09,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c2d537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:16:09" (3/4) ... [2020-06-22 04:16:09,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c2d537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:16:09" (4/4) ... [2020-06-22 04:16:09,715 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:16:09,725 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:16:09,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:16:09,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:16:09,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:16:09,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:16:09,781 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:16:09,781 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:16:09,782 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:16:09,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:16:09,782 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:16:09,782 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:16:09,782 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:16:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 04:16:09,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:16:09,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 04:16:09,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:16:09,859 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 32) no Hoare annotation was computed. [2020-06-22 04:16:09,859 INFO L451 ceAbstractionStarter]: At program point L27-2(lines 18 34) the Hoare annotation is: true [2020-06-22 04:16:09,860 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 25) no Hoare annotation was computed. [2020-06-22 04:16:09,860 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 33) no Hoare annotation was computed. [2020-06-22 04:16:09,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:16:09 BasicIcfg [2020-06-22 04:16:09,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:16:09,869 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:16:09,869 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:16:09,872 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:16:09,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:16:09,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:16:09" (1/5) ... [2020-06-22 04:16:09,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d35992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:16:09,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:16:09" (2/5) ... [2020-06-22 04:16:09,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d35992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:16:09,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:16:09" (3/5) ... [2020-06-22 04:16:09,875 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d35992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,875 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:16:09,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:16:09" (4/5) ... [2020-06-22 04:16:09,876 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d35992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:16:09, skipping insertion in model container [2020-06-22 04:16:09,876 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:16:09,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:16:09" (5/5) ... [2020-06-22 04:16:09,878 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:16:09,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:16:09,904 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:16:09,904 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:16:09,904 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:16:09,904 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:16:09,905 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:16:09,905 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:16:09,905 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:16:09,905 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:16:09,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 04:16:09,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:16:09,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:09,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:09,933 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:16:09,933 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:09,933 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:16:09,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 04:16:09,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:16:09,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:09,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:09,935 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:16:09,935 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:09,940 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L27-2true [2020-06-22 04:16:09,941 INFO L796 eck$LassoCheckResult]: Loop: 6#L27-2true [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 5#L19true [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 4#L27true [38] L27-->L27-2: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_14 |v_ULTIMATE.start_main_#t~nondet5_3|) (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L27-2true [2020-06-22 04:16:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times [2020-06-22 04:16:09,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:09,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 84234, now seen corresponding path program 1 times [2020-06-22 04:16:10,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:10,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:10,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:10,062 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 04:16:10,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:16:10,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:16:10,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:16:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:16:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:16:10,086 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2020-06-22 04:16:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:16:10,138 INFO L93 Difference]: Finished difference Result 7 states and 13 transitions. [2020-06-22 04:16:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:16:10,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 13 transitions. [2020-06-22 04:16:10,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:16:10,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 13 transitions. [2020-06-22 04:16:10,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 04:16:10,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 04:16:10,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 13 transitions. [2020-06-22 04:16:10,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:16:10,150 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 13 transitions. [2020-06-22 04:16:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 13 transitions. [2020-06-22 04:16:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 04:16:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:16:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2020-06-22 04:16:10,180 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 13 transitions. [2020-06-22 04:16:10,180 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 13 transitions. [2020-06-22 04:16:10,180 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:16:10,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 13 transitions. [2020-06-22 04:16:10,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:16:10,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:10,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:10,182 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:16:10,182 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:10,182 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 22#L27-2 [2020-06-22 04:16:10,182 INFO L796 eck$LassoCheckResult]: Loop: 22#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 24#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 25#L20 [57] L20-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~y~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 22#L27-2 [2020-06-22 04:16:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 2 times [2020-06-22 04:16:10,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:10,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash 83912, now seen corresponding path program 1 times [2020-06-22 04:16:10,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:10,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:16:10,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:10,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2020327, now seen corresponding path program 1 times [2020-06-22 04:16:10,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:10,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:10,268 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:10,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:10,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:10,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:10,271 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:16:10,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:10,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:10,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:10,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:16:10,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:10,273 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:10,304 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 04:16:10,317 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 04:16:10,322 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 04:16:10,334 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 04:16:10,339 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 04:16:10,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:10,450 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 04:16:10,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:10,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:10,502 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:10,502 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 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 04:16:10,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:10,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:10,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:10,548 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 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 04:16:10,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:10,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:10,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:10,564 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_#t~nondet3=4} Honda state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_#t~nondet3=4} 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 04:16:10,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:10,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:10,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:10,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 04:16:10,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:10,648 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:16:10,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:16:10,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:10,724 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:16:10,727 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:10,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:10,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:10,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:10,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:16:10,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:16:10,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:10,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:10,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:16:10,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:10,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:10,731 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 04:16:10,738 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 04:16:10,742 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 04:16:10,750 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 04:16:10,755 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 04:16:10,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:10,839 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:16:10,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 04:16:10,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:10,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:10,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:10,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:10,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:16:10,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:16:10,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:10,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:16:10,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:10,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:10,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:10,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:10,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:16:10,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:16:10,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:10,879 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 04:16:10,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:10,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:10,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:10,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:10,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:10,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:10,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:10,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:10,887 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 04:16:10,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:10,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:10,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:10,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:10,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:10,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:10,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:10,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:10,892 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 04:16:10,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:10,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:10,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:10,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:10,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:10,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:10,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:10,901 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:16:10,906 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:16:10,907 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:16:10,909 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:16:10,909 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:16:10,909 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:16:10,910 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 04:16:10,911 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:16:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:10,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:16:10,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:10,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:10,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:10,971 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 04:16:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:10,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:10,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:11,025 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:16:11,029 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 04:16:11,030 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 13 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 04:16:11,097 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 13 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 37 transitions. Complement of second has 6 states. [2020-06-22 04:16:11,098 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 04:16:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:16:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-06-22 04:16:11,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 04:16:11,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:11,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 04:16:11,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:11,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 04:16:11,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:11,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 37 transitions. [2020-06-22 04:16:11,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 04:16:11,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 36 transitions. [2020-06-22 04:16:11,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 04:16:11,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 04:16:11,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 36 transitions. [2020-06-22 04:16:11,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:16:11,112 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 36 transitions. [2020-06-22 04:16:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 36 transitions. [2020-06-22 04:16:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2020-06-22 04:16:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 04:16:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2020-06-22 04:16:11,115 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. [2020-06-22 04:16:11,115 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. [2020-06-22 04:16:11,115 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:16:11,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 31 transitions. [2020-06-22 04:16:11,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 04:16:11,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:11,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:11,117 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 04:16:11,117 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:11,117 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 93#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 101#L19 [2020-06-22 04:16:11,118 INFO L796 eck$LassoCheckResult]: Loop: 101#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 103#L20 [47] L20-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 100#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 101#L19 [2020-06-22 04:16:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2101, now seen corresponding path program 1 times [2020-06-22 04:16:11,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:11,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 68782, now seen corresponding path program 1 times [2020-06-22 04:16:11,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:11,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:11,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash 62629882, now seen corresponding path program 1 times [2020-06-22 04:16:11,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:11,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,185 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:11,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:11,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:11,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:11,185 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:16:11,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:11,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:11,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:11,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:16:11,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:11,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:11,188 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 04:16:11,192 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 04:16:11,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:11,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:11,201 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 04:16:11,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:11,279 INFO L412 LassoAnalysis]: Checking for nontermination... 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 04:16:11,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:11,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:11,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:11,311 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 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 04:16:11,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:11,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:11,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:11,347 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:11,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:11,353 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:11,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:11,381 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=1} Honda state: {ULTIMATE.start_main_~x~0=1} 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 04:16:11,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:11,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:11,401 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:11,401 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} 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 04:16:11,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:11,436 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:16:11,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:16:11,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:11,546 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:16:11,548 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:11,548 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:11,548 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:11,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:11,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:16:11,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:16:11,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:11,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:11,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:16:11,549 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:11,549 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:11,551 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 04:16:11,555 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 04:16:11,558 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 04:16:11,560 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 04:16:11,563 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 04:16:11,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:11,638 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:16:11,638 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 04:16:11,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:11,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:11,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:11,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:11,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:16:11,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:16:11,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:11,647 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 04:16:11,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:11,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:11,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:11,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:11,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:16:11,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:16:11,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:11,655 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 04:16:11,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:11,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:11,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:11,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:11,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:11,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:11,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:11,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:11,658 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 04:16:11,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:11,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:11,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:11,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:11,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:11,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:11,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:11,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:11,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:16:11,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:11,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:11,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:11,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:11,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:11,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:11,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:11,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:16:11,670 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:16:11,670 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:16:11,670 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:16:11,670 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:16:11,671 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:16:11,671 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:16:11,671 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:16:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:11,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:16:11,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:11,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:11,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:11,703 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 04:16:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:11,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:11,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:11,735 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:16:11,736 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 04:16:11,736 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 31 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-06-22 04:16:11,779 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 31 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 34 states and 56 transitions. Complement of second has 7 states. [2020-06-22 04:16:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 04:16:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:16:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-06-22 04:16:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 04:16:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 04:16:11,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:11,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 04:16:11,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:11,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 56 transitions. [2020-06-22 04:16:11,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 04:16:11,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 25 states and 44 transitions. [2020-06-22 04:16:11,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 04:16:11,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 04:16:11,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 44 transitions. [2020-06-22 04:16:11,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:16:11,788 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-06-22 04:16:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 44 transitions. [2020-06-22 04:16:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-06-22 04:16:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 04:16:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2020-06-22 04:16:11,792 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 42 transitions. [2020-06-22 04:16:11,792 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 42 transitions. [2020-06-22 04:16:11,792 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:16:11,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 42 transitions. [2020-06-22 04:16:11,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 04:16:11,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:11,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:11,794 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:16:11,794 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:11,794 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 193#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 206#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 194#L27 [2020-06-22 04:16:11,795 INFO L796 eck$LassoCheckResult]: Loop: 194#L27 [38] L27-->L27-2: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_14 |v_ULTIMATE.start_main_#t~nondet5_3|) (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 195#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 207#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 194#L27 [2020-06-22 04:16:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash 65212, now seen corresponding path program 1 times [2020-06-22 04:16:11,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:11,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:11,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash 68095, now seen corresponding path program 1 times [2020-06-22 04:16:11,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:11,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1942768996, now seen corresponding path program 1 times [2020-06-22 04:16:11,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:11,847 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:11,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:11,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:11,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:11,848 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:16:11,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:11,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:11,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:11,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:16:11,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:11,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:11,850 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 04:16:11,858 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 04:16:11,861 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 04:16:11,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:11,872 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 04:16:11,931 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:11,932 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:11,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:11,935 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:16:11,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:16:11,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:12,045 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:16:12,047 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:12,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:12,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:12,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:12,048 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:16:12,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:16:12,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:12,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:12,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:16:12,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:12,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:12,050 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 04:16:12,057 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 04:16:12,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 04:16:12,067 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 04:16:12,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 04:16:12,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:12,132 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:16:12,132 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 04:16:12,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:12,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:12,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:12,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:12,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:12,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:12,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:12,138 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:16:12,141 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:16:12,142 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:16:12,142 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:16:12,142 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:16:12,142 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:16:12,142 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 04:16:12,143 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:16:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:16:12,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:12,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:12,196 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 04:16:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:12,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:12,210 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:16:12,211 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 04:16:12,211 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 42 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-06-22 04:16:12,306 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 42 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 65 states and 121 transitions. Complement of second has 20 states. [2020-06-22 04:16:12,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 04:16:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:16:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 04:16:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 04:16:12,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 04:16:12,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:12,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 04:16:12,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:12,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 121 transitions. [2020-06-22 04:16:12,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2020-06-22 04:16:12,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 55 states and 102 transitions. [2020-06-22 04:16:12,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 04:16:12,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-06-22 04:16:12,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 102 transitions. [2020-06-22 04:16:12,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:16:12,317 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 102 transitions. [2020-06-22 04:16:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 102 transitions. [2020-06-22 04:16:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2020-06-22 04:16:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 04:16:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 69 transitions. [2020-06-22 04:16:12,321 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 69 transitions. [2020-06-22 04:16:12,321 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 69 transitions. [2020-06-22 04:16:12,321 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:16:12,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 69 transitions. [2020-06-22 04:16:12,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 04:16:12,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:12,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:12,324 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:16:12,324 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 04:16:12,324 INFO L794 eck$LassoCheckResult]: Stem: 349#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 350#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 370#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 369#L27 [2020-06-22 04:16:12,324 INFO L796 eck$LassoCheckResult]: Loop: 369#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 352#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 356#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 357#L20 [57] L20-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~y~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 363#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 371#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 369#L27 [2020-06-22 04:16:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash 65212, now seen corresponding path program 2 times [2020-06-22 04:16:12,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:12,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1666331639, now seen corresponding path program 1 times [2020-06-22 04:16:12,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:16:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,353 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 04:16:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:16:12,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 04:16:12,354 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:16:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:16:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:16:12,354 INFO L87 Difference]: Start difference. First operand 34 states and 69 transitions. cyclomatic complexity: 37 Second operand 4 states. [2020-06-22 04:16:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:16:12,385 INFO L93 Difference]: Finished difference Result 31 states and 60 transitions. [2020-06-22 04:16:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:16:12,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 60 transitions. [2020-06-22 04:16:12,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 04:16:12,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 43 transitions. [2020-06-22 04:16:12,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:16:12,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:16:12,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 43 transitions. [2020-06-22 04:16:12,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:16:12,390 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 43 transitions. [2020-06-22 04:16:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 43 transitions. [2020-06-22 04:16:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 04:16:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 04:16:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 43 transitions. [2020-06-22 04:16:12,392 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 43 transitions. [2020-06-22 04:16:12,392 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 43 transitions. [2020-06-22 04:16:12,393 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:16:12,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 43 transitions. [2020-06-22 04:16:12,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 04:16:12,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:12,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:12,395 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 04:16:12,395 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:12,395 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 422#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 428#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 429#L27 [60] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 424#L27-2 [2020-06-22 04:16:12,396 INFO L796 eck$LassoCheckResult]: Loop: 424#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 441#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 423#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 424#L27-2 [2020-06-22 04:16:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2021632, now seen corresponding path program 1 times [2020-06-22 04:16:12,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 85216, now seen corresponding path program 1 times [2020-06-22 04:16:12,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:12,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 96952193, now seen corresponding path program 1 times [2020-06-22 04:16:12,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:12,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,444 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:12,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:12,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:12,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:12,445 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:16:12,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:12,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:12,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:12,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 04:16:12,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:12,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:12,447 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 04:16:12,450 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 04:16:12,455 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 04:16:12,458 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 04:16:12,460 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 04:16:12,498 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:12,498 INFO L412 LassoAnalysis]: Checking for nontermination... 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 04:16:12,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:12,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:12,545 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:12,545 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 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 04:16:12,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:12,550 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:16:12,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:16:12,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:12,619 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:16:12,621 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:12,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:12,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:12,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:12,622 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:16:12,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:16:12,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:12,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:12,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 04:16:12,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:12,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:12,624 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 04:16:12,628 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 04:16:12,634 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 04:16:12,637 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 04:16:12,639 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 04:16:12,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:12,681 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:16:12,681 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 04:16:12,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:12,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:12,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:12,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:12,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:12,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:12,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:12,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:12,685 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 04:16:12,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:12,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:12,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:12,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:12,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:12,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:12,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:12,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:16:12,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:16:12,692 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:16:12,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:16:12,692 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:16:12,692 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:16:12,693 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 04:16:12,693 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:16:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:16:12,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:12,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:12,735 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 04:16:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:12,750 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:12,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:12,760 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:16:12,760 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 04:16:12,760 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 43 transitions. cyclomatic complexity: 25 Second operand 4 states. [2020-06-22 04:16:12,806 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 43 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 55 states and 95 transitions. Complement of second has 7 states. [2020-06-22 04:16:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:16:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:16:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-06-22 04:16:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 04:16:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:12,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 04:16:12,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:12,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 04:16:12,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:12,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 95 transitions. [2020-06-22 04:16:12,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 04:16:12,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 36 states and 66 transitions. [2020-06-22 04:16:12,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 04:16:12,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 04:16:12,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 66 transitions. [2020-06-22 04:16:12,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:16:12,814 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 66 transitions. [2020-06-22 04:16:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 66 transitions. [2020-06-22 04:16:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-06-22 04:16:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 04:16:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 58 transitions. [2020-06-22 04:16:12,817 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 58 transitions. [2020-06-22 04:16:12,817 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 58 transitions. [2020-06-22 04:16:12,817 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 04:16:12,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 58 transitions. [2020-06-22 04:16:12,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 04:16:12,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:12,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:12,818 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 04:16:12,819 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:16:12,819 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 551#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 567#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 568#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 553#L27-2 [2020-06-22 04:16:12,819 INFO L796 eck$LassoCheckResult]: Loop: 553#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 573#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 552#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 553#L27-2 [2020-06-22 04:16:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2021631, now seen corresponding path program 1 times [2020-06-22 04:16:12,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:12,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,827 INFO L82 PathProgramCache]: Analyzing trace with hash 85216, now seen corresponding path program 2 times [2020-06-22 04:16:12,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:12,832 INFO L82 PathProgramCache]: Analyzing trace with hash 96922402, now seen corresponding path program 2 times [2020-06-22 04:16:12,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:12,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:16:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:12,866 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:12,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:12,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:12,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:12,867 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:16:12,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:12,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:12,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:12,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 04:16:12,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:12,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:12,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:12,872 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 04:16:12,878 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 04:16:12,883 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 04:16:12,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:12,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:12,924 INFO L412 LassoAnalysis]: Checking for nontermination... 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 04:16:12,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:12,927 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:12,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:12,954 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 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 04:16:12,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:12,959 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:16:12,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:16:12,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:13,035 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:16:13,040 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:13,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:13,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:13,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:13,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:16:13,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:16:13,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:13,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:13,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 04:16:13,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:13,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:13,042 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 04:16:13,045 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 04:16:13,054 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 04:16:13,057 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 04:16:13,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 04:16:13,111 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:13,111 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:16:13,112 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 04:16:13,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:13,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:13,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:13,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:13,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:13,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:13,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:13,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:13,116 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 04:16:13,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:13,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:13,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:13,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:13,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:13,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:13,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:13,121 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:16:13,123 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:16:13,123 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:16:13,123 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:16:13,124 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:16:13,124 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:16:13,124 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 04:16:13,124 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:16:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,159 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 04:16:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,174 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,185 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:16:13,186 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 04:16:13,186 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 58 transitions. cyclomatic complexity: 32 Second operand 4 states. [2020-06-22 04:16:13,240 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 58 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 81 states and 139 transitions. Complement of second has 7 states. [2020-06-22 04:16:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:16:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:16:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-06-22 04:16:13,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 04:16:13,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:13,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 04:16:13,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:13,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 04:16:13,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:13,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 139 transitions. [2020-06-22 04:16:13,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 04:16:13,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 55 states and 97 transitions. [2020-06-22 04:16:13,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 04:16:13,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 04:16:13,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 97 transitions. [2020-06-22 04:16:13,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:16:13,248 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 97 transitions. [2020-06-22 04:16:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 97 transitions. [2020-06-22 04:16:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2020-06-22 04:16:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 04:16:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2020-06-22 04:16:13,251 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 54 transitions. [2020-06-22 04:16:13,251 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 54 transitions. [2020-06-22 04:16:13,251 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 04:16:13,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 54 transitions. [2020-06-22 04:16:13,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 04:16:13,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:16:13,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:16:13,253 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 04:16:13,253 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-06-22 04:16:13,253 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~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_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 715#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 728#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 729#L27 [60] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 717#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 720#L19 [2020-06-22 04:16:13,254 INFO L796 eck$LassoCheckResult]: Loop: 720#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 721#L20 [57] L20-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~y~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 723#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 727#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 724#L20 [47] L20-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 725#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 720#L19 [2020-06-22 04:16:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash 62670647, now seen corresponding path program 1 times [2020-06-22 04:16:13,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:13,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:13,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:13,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:16:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:16:13,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:16:13,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:16:13,271 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 04:16:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2058358763, now seen corresponding path program 1 times [2020-06-22 04:16:13,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:16:13,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:16:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:13,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:16:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:16:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:16:13,317 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:13,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:13,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:13,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:13,318 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:16:13,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:16:13,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:13,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:13,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 04:16:13,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:13,318 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:13,320 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 04:16:13,323 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 04:16:13,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:13,328 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 04:16:13,334 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 04:16:13,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:13,383 INFO L412 LassoAnalysis]: Checking for nontermination... 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 04:16:13,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:13,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:13,417 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:13,418 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 04:16:13,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:13,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:13,462 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:13,463 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 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 04:16:13,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:13,469 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:13,505 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:16:13,506 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 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 04:16:13,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:16:13,511 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 04:16:13,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:16:13,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:16:13,641 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:16:13,644 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:16:13,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:16:13,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:16:13,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:16:13,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:16:13,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:16:13,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:16:13,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:16:13,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 04:16:13,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:16:13,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:16:13,646 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 04:16:13,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:16:13,651 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 04:16:13,654 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 04:16:13,660 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 04:16:13,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:16:13,718 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:16:13,718 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 04:16:13,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:13,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:13,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:13,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:13,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:13,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:13,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:13,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:13,724 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 04:16:13,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:13,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:13,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:13,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:13,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:16:13,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:16:13,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:13,730 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 04:16:13,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:13,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:13,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:13,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:13,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:16:13,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:16:13,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:16:13,735 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 04:16:13,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:16:13,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:16:13,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:16:13,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:16:13,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:16:13,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:16:13,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:16:13,739 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:16:13,741 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:16:13,742 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:16:13,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:16:13,742 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:16:13,742 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:16:13,742 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 04:16:13,743 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:16:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:16:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:16:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:16:13,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:16:13,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:16:13,881 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:16:13,881 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 04:16:13,882 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 54 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-06-22 04:16:13,922 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 54 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 48 states and 86 transitions. Complement of second has 8 states. [2020-06-22 04:16:13,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 04:16:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 04:16:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-06-22 04:16:13,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 04:16:13,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:13,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 04:16:13,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:13,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 12 letters. [2020-06-22 04:16:13,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:16:13,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 86 transitions. [2020-06-22 04:16:13,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:16:13,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2020-06-22 04:16:13,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:16:13,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:16:13,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:16:13,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:16:13,928 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:16:13,928 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:16:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:16:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:16:13,929 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-06-22 04:16:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:16:13,929 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-06-22 04:16:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 04:16:13,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-06-22 04:16:13,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:16:13,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 04:16:13,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:16:13,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:16:13,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:16:13,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:16:13,933 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:16:13,933 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:16:13,934 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:16:13,934 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 04:16:13,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:16:13,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:16:13,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:16:13,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:16:13 BasicIcfg [2020-06-22 04:16:13,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:16:13,945 INFO L168 Benchmark]: Toolchain (without parser) took 4926.12 ms. Allocated memory was 514.9 MB in the beginning and 642.3 MB in the end (delta: 127.4 MB). Free memory was 437.6 MB in the beginning and 591.3 MB in the end (delta: -153.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:16:13,947 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:16:13,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.06 ms. Allocated memory was 514.9 MB in the beginning and 563.6 MB in the end (delta: 48.8 MB). Free memory was 437.6 MB in the beginning and 535.5 MB in the end (delta: -97.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. [2020-06-22 04:16:13,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.39 ms. Allocated memory is still 563.6 MB. Free memory was 535.5 MB in the beginning and 533.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:16:13,949 INFO L168 Benchmark]: Boogie Preprocessor took 24.21 ms. Allocated memory is still 563.6 MB. Free memory was 533.7 MB in the beginning and 532.9 MB in the end (delta: 850.8 kB). Peak memory consumption was 850.8 kB. Max. memory is 50.3 GB. [2020-06-22 04:16:13,949 INFO L168 Benchmark]: RCFGBuilder took 219.09 ms. Allocated memory is still 563.6 MB. Free memory was 532.9 MB in the beginning and 520.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-06-22 04:16:13,950 INFO L168 Benchmark]: BlockEncodingV2 took 86.10 ms. Allocated memory is still 563.6 MB. Free memory was 520.8 MB in the beginning and 515.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:16:13,951 INFO L168 Benchmark]: TraceAbstraction took 160.81 ms. Allocated memory is still 563.6 MB. Free memory was 514.3 MB in the beginning and 505.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:16:13,951 INFO L168 Benchmark]: BuchiAutomizer took 4075.60 ms. Allocated memory was 563.6 MB in the beginning and 642.3 MB in the end (delta: 78.6 MB). Free memory was 505.8 MB in the beginning and 591.3 MB in the end (delta: -85.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:16:13,956 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 317.06 ms. Allocated memory was 514.9 MB in the beginning and 563.6 MB in the end (delta: 48.8 MB). Free memory was 437.6 MB in the beginning and 535.5 MB in the end (delta: -97.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.39 ms. Allocated memory is still 563.6 MB. Free memory was 535.5 MB in the beginning and 533.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.21 ms. Allocated memory is still 563.6 MB. Free memory was 533.7 MB in the beginning and 532.9 MB in the end (delta: 850.8 kB). Peak memory consumption was 850.8 kB. Max. memory is 50.3 GB. * RCFGBuilder took 219.09 ms. Allocated memory is still 563.6 MB. Free memory was 532.9 MB in the beginning and 520.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 86.10 ms. Allocated memory is still 563.6 MB. Free memory was 520.8 MB in the beginning and 515.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 160.81 ms. Allocated memory is still 563.6 MB. Free memory was 514.3 MB in the beginning and 505.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4075.60 ms. Allocated memory was 563.6 MB in the beginning and 642.3 MB in the end (delta: 78.6 MB). Free memory was 505.8 MB in the beginning and 591.3 MB in the end (delta: -85.4 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: 18]: 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 x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function -1 * x and consists of 5 locations. One nondeterministic module has affine ranking function -1 * x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 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 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 39 SDtfs, 108 SDslu, 27 SDs, 0 SdLazy, 254 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax168 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:16:05.769 ----------------------------------------------- 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 04:16:14.191 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check