YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:15:38,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:15:38,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:15:38,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:15:38,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:15:38,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:15:38,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:15:38,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:15:38,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:15:38,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:15:38,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:15:38,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:15:38,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:15:38,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:15:38,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:15:38,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:15:38,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:15:38,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:15:38,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:15:38,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:15:38,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:15:38,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:15:38,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:15:38,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:15:38,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:15:38,494 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:15:38,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:15:38,495 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:15:38,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:15:38,496 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:15:38,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:15:38,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:15:38,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:15:38,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:15:38,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:15:38,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:15:38,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:15:38,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:15:38,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:15:38,502 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 04:15:38,516 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:15:38,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:15:38,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:15:38,518 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:15:38,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:15:38,518 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:15:38,518 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:15:38,518 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:15:38,519 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:15:38,519 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:15:38,519 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:15:38,519 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:15:38,519 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:15:38,519 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:15:38,520 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:15:38,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:15:38,520 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:15:38,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:15:38,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:15:38,521 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:15:38,521 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:15:38,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:15:38,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:15:38,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:15:38,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:15:38,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:15:38,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:15:38,522 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:15:38,522 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:15:38,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:15:38,560 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:15:38,564 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:15:38,565 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:15:38,565 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:15:38,566 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:15:38,626 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ce46172508a545ae8fa14e1188211968/FLAG4734cc359 [2020-06-22 04:15:38,962 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:15:38,963 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:15:38,969 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ce46172508a545ae8fa14e1188211968/FLAG4734cc359 [2020-06-22 04:15:39,396 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ce46172508a545ae8fa14e1188211968 [2020-06-22 04:15:39,407 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:15:39,409 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:15:39,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:15:39,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:15:39,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:15:39,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a92cc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39, skipping insertion in model container [2020-06-22 04:15:39,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:15:39,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:15:39,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:15:39,612 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:15:39,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:15:39,704 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:15:39,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39 WrapperNode [2020-06-22 04:15:39,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:15:39,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:15:39,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:15:39,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:15:39,715 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:15:39" (1/1) ... [2020-06-22 04:15:39,720 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:15:39" (1/1) ... [2020-06-22 04:15:39,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:15:39,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:15:39,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:15:39,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:15:39,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:15:39,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:15:39,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:15:39,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:15:39,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (1/1) ... No working directory specified, using /export/starexec/sandbox/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:15:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:15:39,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:15:39,955 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:15:39,956 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 04:15:39,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:15:39 BoogieIcfgContainer [2020-06-22 04:15:39,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:15:39,958 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:15:39,958 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:15:39,960 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:15:39,960 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:15:39" (1/1) ... [2020-06-22 04:15:39,975 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges [2020-06-22 04:15:39,976 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:15:39,977 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:15:39,978 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:15:39,978 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:15:39,981 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:15:39,982 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:15:39,982 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:15:39,997 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:15:40,011 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 04:15:40,016 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 04:15:40,018 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:15:40,026 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 04:15:40,028 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 04:15:40,029 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:15:40,030 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:15:40,030 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:15:40,030 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:15:40,031 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 11 edges [2020-06-22 04:15:40,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:15:40 BasicIcfg [2020-06-22 04:15:40,031 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:15:40,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:15:40,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:15:40,035 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:15:40,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:15:39" (1/4) ... [2020-06-22 04:15:40,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee0bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (2/4) ... [2020-06-22 04:15:40,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee0bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:15:39" (3/4) ... [2020-06-22 04:15:40,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee0bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:15:40" (4/4) ... [2020-06-22 04:15:40,039 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:15:40,049 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:15:40,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:15:40,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:15:40,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:15:40,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:15:40,103 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:15:40,103 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:15:40,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:15:40,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:15:40,103 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:15:40,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:15:40,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:15:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2020-06-22 04:15:40,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:15:40,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-06-22 04:15:40,177 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-06-22 04:15:40,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:15:40,177 INFO L448 ceAbstractionStarter]: For program point L30-2(lines 30 34) no Hoare annotation was computed. [2020-06-22 04:15:40,177 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 27) no Hoare annotation was computed. [2020-06-22 04:15:40,177 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 36) no Hoare annotation was computed. [2020-06-22 04:15:40,178 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 27) no Hoare annotation was computed. [2020-06-22 04:15:40,178 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 21 37) the Hoare annotation is: true [2020-06-22 04:15:40,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:15:40 BasicIcfg [2020-06-22 04:15:40,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:15:40,187 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:15:40,187 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:15:40,190 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:15:40,191 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:15:40,191 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:15:39" (1/5) ... [2020-06-22 04:15:40,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e304c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,192 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:15:40,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:15:39" (2/5) ... [2020-06-22 04:15:40,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e304c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,193 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:15:40,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:15:39" (3/5) ... [2020-06-22 04:15:40,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e304c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,194 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:15:40,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:15:40" (4/5) ... [2020-06-22 04:15:40,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e304c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:15:40, skipping insertion in model container [2020-06-22 04:15:40,194 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:15:40,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:15:40" (5/5) ... [2020-06-22 04:15:40,197 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:15:40,224 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:15:40,225 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:15:40,225 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:15:40,225 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:15:40,225 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:15:40,225 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:15:40,225 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:15:40,226 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:15:40,226 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:15:40,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-06-22 04:15:40,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:15:40,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:15:40,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:15:40,252 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:15:40,253 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 04:15:40,253 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:15:40,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-06-22 04:15:40,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:15:40,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:15:40,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:15:40,254 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:15:40,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 04:15:40,260 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [37] ULTIMATE.startENTRY-->L22-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~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~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 9#L22-2true [2020-06-22 04:15:40,260 INFO L796 eck$LassoCheckResult]: Loop: 9#L22-2true [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 5#L22true [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 7#L23true [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 3#L23-2true [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 9#L22-2true [2020-06-22 04:15:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2020-06-22 04:15:40,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:40,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2438744, now seen corresponding path program 1 times [2020-06-22 04:15:40,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:40,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 64314651, now seen corresponding path program 1 times [2020-06-22 04:15:40,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:40,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:40,453 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:40,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:40,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:40,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:40,455 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:15:40,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:15:40,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:40,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:40,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:15:40,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:40,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:40,474 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:15:40,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:15:40,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:40,555 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:15:40,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:40,562 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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:15:40,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:15:40,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:40,641 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:15:40,643 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:40,643 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:40,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:40,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:40,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:15:40,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:15:40,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:40,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:40,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:15:40,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:40,644 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:40,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:15:40,658 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:15:40,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:40,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:15:40,726 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:15:40,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:40,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:40,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:40,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:40,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:40,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:40,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:40,745 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:15:40,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:15:40,755 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:15:40,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:15:40,757 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:15:40,758 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:15:40,758 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:15:40,760 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:15:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:40,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:15:40,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:40,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:15:40,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:40,840 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:15:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:40,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:15:40,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:40,905 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 04:15:40,910 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 04:15:40,911 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states. Second operand 4 states. [2020-06-22 04:15:41,011 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states.. Second operand 4 states. Result 26 states and 44 transitions. Complement of second has 10 states. [2020-06-22 04:15:41,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 04:15:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:15:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-06-22 04:15:41,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 04:15:41,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:41,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 04:15:41,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:41,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 1 letters. Loop has 8 letters. [2020-06-22 04:15:41,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:41,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 44 transitions. [2020-06-22 04:15:41,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:15:41,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 26 transitions. [2020-06-22 04:15:41,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:15:41,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 04:15:41,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2020-06-22 04:15:41,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:15:41,034 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 04:15:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2020-06-22 04:15:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-06-22 04:15:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 04:15:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2020-06-22 04:15:41,063 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-06-22 04:15:41,063 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-06-22 04:15:41,063 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:15:41,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 22 transitions. [2020-06-22 04:15:41,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:15:41,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:15:41,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:15:41,065 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:15:41,065 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 04:15:41,066 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-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~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~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 100#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 101#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 102#L30 [2020-06-22 04:15:41,066 INFO L796 eck$LassoCheckResult]: Loop: 102#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 105#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 95#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 107#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 102#L30 [2020-06-22 04:15:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 66906, now seen corresponding path program 1 times [2020-06-22 04:15:41,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2542442, now seen corresponding path program 1 times [2020-06-22 04:15:41,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1661172803, now seen corresponding path program 1 times [2020-06-22 04:15:41,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:41,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:41,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,125 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:41,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:41,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:41,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:41,125 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:15:41,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:15:41,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:41,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:41,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:15:41,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:41,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:41,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:15:41,151 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:15:41,224 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:41,225 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:15:41,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:41,234 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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:15:41,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:15:41,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:41,430 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:15:41,433 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:41,433 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:41,433 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:41,433 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:41,433 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:15:41,433 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:15:41,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:41,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:41,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:15:41,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:41,434 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:41,435 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:15:41,449 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:15:41,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:41,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:15:41,509 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:15:41,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:41,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:41,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:41,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:41,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:41,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:41,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:41,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:15:41,531 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:15:41,531 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:15:41,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:15:41,532 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:15:41,532 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:15:41,532 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:15:41,532 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:15:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:41,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:15:41,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:41,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:15:41,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:41,577 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:15:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:41,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:15:41,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:41,591 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:15:41,591 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:15:41,592 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 22 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-06-22 04:15:41,688 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 22 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 32 states and 53 transitions. Complement of second has 17 states. [2020-06-22 04:15:41,689 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:15:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:15:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2020-06-22 04:15:41,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 04:15:41,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:41,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. [2020-06-22 04:15:41,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:41,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 04:15:41,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:41,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 53 transitions. [2020-06-22 04:15:41,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 04:15:41,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 38 transitions. [2020-06-22 04:15:41,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:15:41,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 04:15:41,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 38 transitions. [2020-06-22 04:15:41,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:15:41,699 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-06-22 04:15:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 38 transitions. [2020-06-22 04:15:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-06-22 04:15:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 04:15:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2020-06-22 04:15:41,703 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. [2020-06-22 04:15:41,703 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 35 transitions. [2020-06-22 04:15:41,703 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:15:41,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 35 transitions. [2020-06-22 04:15:41,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 04:15:41,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:15:41,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:15:41,705 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:15:41,706 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 04:15:41,706 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-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~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~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 217#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 227#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 225#L30 [2020-06-22 04:15:41,706 INFO L796 eck$LassoCheckResult]: Loop: 225#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 222#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 223#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 228#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 219#L23 [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 211#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 212#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 232#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 225#L30 [2020-06-22 04:15:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash 66906, now seen corresponding path program 2 times [2020-06-22 04:15:41,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1331247487, now seen corresponding path program 1 times [2020-06-22 04:15:41,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:41,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:15:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 27091674, now seen corresponding path program 1 times [2020-06-22 04:15:41,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:41,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:41,795 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:41,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:41,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:41,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:41,796 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:15:41,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:15:41,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:41,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:41,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:15:41,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:41,797 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:41,798 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:15:41,801 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:15:41,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:41,854 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:15:41,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:41,857 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:41,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:15:41,886 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/sandbox/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:15:41,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:41,891 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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:15:41,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:15:41,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:42,070 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:15:42,073 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:42,073 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:42,073 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:42,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:42,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:15:42,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:15:42,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:42,074 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:42,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:15:42,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:42,074 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:42,075 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:15:42,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:15:42,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:42,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:15:42,147 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:15:42,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:42,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:42,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:42,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:42,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:42,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:42,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:42,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:15:42,152 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:15:42,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:42,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:42,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:42,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:42,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:42,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:42,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:42,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:15:42,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:15:42,168 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:15:42,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:15:42,169 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:15:42,169 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:15:42,169 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:15:42,170 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:15:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:42,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:15:42,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:42,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:15:42,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:15:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,243 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,252 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:42,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:15:42,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:42,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:15:42,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:42,294 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 04:15:42,295 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 04:15:42,295 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 35 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-06-22 04:15:42,568 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 35 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 61 states and 95 transitions. Complement of second has 28 states. [2020-06-22 04:15:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 3 accepting loop states [2020-06-22 04:15:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 04:15:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-06-22 04:15:42,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 04:15:42,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:42,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. [2020-06-22 04:15:42,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:42,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 34 transitions. Stem has 3 letters. Loop has 16 letters. [2020-06-22 04:15:42,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:42,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 95 transitions. [2020-06-22 04:15:42,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-06-22 04:15:42,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 37 states and 57 transitions. [2020-06-22 04:15:42,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 04:15:42,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 04:15:42,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2020-06-22 04:15:42,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:15:42,578 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2020-06-22 04:15:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2020-06-22 04:15:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-06-22 04:15:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 04:15:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2020-06-22 04:15:42,582 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-06-22 04:15:42,582 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-06-22 04:15:42,582 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:15:42,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 49 transitions. [2020-06-22 04:15:42,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 04:15:42,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:15:42,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:15:42,584 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2020-06-22 04:15:42,584 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 04:15:42,584 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-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~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~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 442#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 456#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 451#L30 [45] L30-->L30-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_10 v_ULTIMATE.start_main_~y~0_10) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 447#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 448#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 466#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 446#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 464#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 458#L22-2 [2020-06-22 04:15:42,585 INFO L796 eck$LassoCheckResult]: Loop: 458#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 443#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 444#L23 [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 439#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 440#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 469#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 452#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 447#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 448#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 466#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 446#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 464#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 458#L22-2 [2020-06-22 04:15:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1569801954, now seen corresponding path program 1 times [2020-06-22 04:15:42,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:42,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1073913814, now seen corresponding path program 2 times [2020-06-22 04:15:42,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:42,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:42,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash -503949881, now seen corresponding path program 1 times [2020-06-22 04:15:42,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:42,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:15:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:42,718 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:42,718 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:42,718 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:42,718 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:42,719 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:15:42,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:15:42,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:42,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:42,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:15:42,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:42,719 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:42,720 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:15:42,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:15:42,759 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:42,759 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:15:42,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:42,763 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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:15:42,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:15:42,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:42,846 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:15:42,848 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:42,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:42,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:42,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:42,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:15:42,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:15:42,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:42,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:42,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:15:42,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:42,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:42,851 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:15:42,862 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:15:42,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:42,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:15:42,893 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:15:42,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:42,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:42,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:42,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:42,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:42,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:42,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:42,901 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:15:42,905 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:15:42,906 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:15:42,906 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:15:42,906 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:15:42,906 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:15:42,906 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:15:42,907 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:15:42,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:42,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:15:42,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:42,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:15:42,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:15:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,017 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,024 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,031 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:43,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:15:43,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:43,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:15:43,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:43,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:15:43,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:43,109 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 04:15:43,109 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-06-22 04:15:43,109 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 49 transitions. cyclomatic complexity: 20 Second operand 7 states. [2020-06-22 04:15:43,417 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 49 transitions. cyclomatic complexity: 20. Second operand 7 states. Result 110 states and 174 transitions. Complement of second has 24 states. [2020-06-22 04:15:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 10 non-accepting loop states 3 accepting loop states [2020-06-22 04:15:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:15:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2020-06-22 04:15:43,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 12 letters. [2020-06-22 04:15:43,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:43,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 21 letters. Loop has 12 letters. [2020-06-22 04:15:43,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:43,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 24 letters. [2020-06-22 04:15:43,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:43,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 174 transitions. [2020-06-22 04:15:43,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2020-06-22 04:15:43,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 78 states and 122 transitions. [2020-06-22 04:15:43,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 04:15:43,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 04:15:43,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 122 transitions. [2020-06-22 04:15:43,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:15:43,426 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 122 transitions. [2020-06-22 04:15:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 122 transitions. [2020-06-22 04:15:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2020-06-22 04:15:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 04:15:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2020-06-22 04:15:43,431 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. [2020-06-22 04:15:43,431 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. [2020-06-22 04:15:43,431 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:15:43,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 69 transitions. [2020-06-22 04:15:43,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-06-22 04:15:43,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:15:43,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:15:43,433 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2020-06-22 04:15:43,433 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 2, 1, 1] [2020-06-22 04:15:43,434 INFO L794 eck$LassoCheckResult]: Stem: 820#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L22-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~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~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 821#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 822#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 823#L30 [45] L30-->L30-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_10 v_ULTIMATE.start_main_~y~0_10) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 830#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 846#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 847#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 841#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 835#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 832#L22-2 [2020-06-22 04:15:43,434 INFO L796 eck$LassoCheckResult]: Loop: 832#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 833#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 853#L23 [52] L23-->L23-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_7 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 818#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 819#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 860#L22 [56] L22-->L23: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 852#L23 [41] L23-->L23-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_6 v_ULTIMATE.start_main_~y~0_7) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~x~0_6 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 829#L23-2 [36] L23-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 850#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 849#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 848#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 830#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 846#L22-2 [49] L22-2-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_5) (< 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 847#L22 [39] L22-->L30: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 841#L30 [53] L30-->L30-2: Formula: (and (>= v_ULTIMATE.start_main_~x~0_12 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~x~0_11 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 835#L30-2 [40] L30-2-->L22-2: Formula: (= v_ULTIMATE.start_main_~y~0_12 |v_ULTIMATE.start_main_#t~nondet4_3|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0] 832#L22-2 [2020-06-22 04:15:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1569801954, now seen corresponding path program 2 times [2020-06-22 04:15:43,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash -480186452, now seen corresponding path program 1 times [2020-06-22 04:15:43,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:43,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:15:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash -830746935, now seen corresponding path program 1 times [2020-06-22 04:15:43,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:15:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:15:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:43,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:15:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:15:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,578 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2020-06-22 04:15:43,592 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:43,592 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:43,592 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:43,592 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:43,592 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:15:43,592 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:15:43,592 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:43,593 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:43,593 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:15:43,593 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:43,593 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:43,594 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:15:43,596 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:15:43,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:43,634 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/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:15:43,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:43,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:43,666 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:15:43,666 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/sandbox/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:15:43,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:15:43,672 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/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:15:43,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:15:43,706 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:15:43,774 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:15:43,778 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:15:43,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:15:43,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:15:43,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:15:43,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:15:43,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:15:43,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:15:43,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:15:43,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:15:43,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:15:43,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:15:43,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:15:43,783 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:15:43,820 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:15:43,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:15:43,821 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:15:43,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:43,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:43,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:43,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:43,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:43,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:43,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:43,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:15:43,825 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:15:43,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:15:43,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:15:43,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:15:43,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:15:43,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:15:43,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:15:43,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:15:43,831 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:15:43,833 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:15:43,834 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:15:43,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:15:43,834 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:15:43,834 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:15:43,834 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:15:43,835 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:15:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:43,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:15:43,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:43,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:15:43,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:15:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,947 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,954 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,964 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,977 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,986 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:15:43,995 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:15:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:44,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:15:44,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:44,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:15:44,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:44,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:15:44,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:44,104 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 11 predicates after loop cannibalization [2020-06-22 04:15:44,104 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 11 loop predicates [2020-06-22 04:15:44,104 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28 Second operand 8 states. [2020-06-22 04:15:44,673 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28. Second operand 8 states. Result 152 states and 229 transitions. Complement of second has 36 states. [2020-06-22 04:15:44,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 16 non-accepting loop states 3 accepting loop states [2020-06-22 04:15:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 04:15:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. [2020-06-22 04:15:44,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 60 transitions. Stem has 9 letters. Loop has 16 letters. [2020-06-22 04:15:44,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:44,676 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 04:15:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:15:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:44,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:15:44,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:15:44,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:15:44,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:15:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:15:44,751 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 04:15:44,752 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28 Second operand 8 states. [2020-06-22 04:15:44,982 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 43 states and 69 transitions. cyclomatic complexity: 28. Second operand 8 states. Result 233 states and 361 transitions. Complement of second has 51 states. [2020-06-22 04:15:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2020-06-22 04:15:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 04:15:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2020-06-22 04:15:44,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 16 letters. [2020-06-22 04:15:44,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:44,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 25 letters. Loop has 16 letters. [2020-06-22 04:15:44,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:44,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 56 transitions. Stem has 9 letters. Loop has 32 letters. [2020-06-22 04:15:44,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:15:44,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 361 transitions. [2020-06-22 04:15:44,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:15:44,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 0 states and 0 transitions. [2020-06-22 04:15:44,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:15:44,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:15:44,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:15:44,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:15:44,992 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:15:44,992 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:15:44,992 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:15:44,992 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:15:44,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:15:44,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:15:44,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:15:44,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:15:44 BasicIcfg [2020-06-22 04:15:44,999 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:15:44,999 INFO L168 Benchmark]: Toolchain (without parser) took 5591.66 ms. Allocated memory was 649.6 MB in the beginning and 772.3 MB in the end (delta: 122.7 MB). Free memory was 564.2 MB in the beginning and 599.7 MB in the end (delta: -35.5 MB). Peak memory consumption was 87.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,000 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:15:45,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.51 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 564.2 MB in the beginning and 655.9 MB in the end (delta: -91.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.63 ms. Allocated memory is still 688.4 MB. Free memory was 655.9 MB in the beginning and 654.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,002 INFO L168 Benchmark]: Boogie Preprocessor took 19.03 ms. Allocated memory is still 688.4 MB. Free memory was 654.6 MB in the beginning and 653.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,002 INFO L168 Benchmark]: RCFGBuilder took 197.64 ms. Allocated memory is still 688.4 MB. Free memory was 653.2 MB in the beginning and 637.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,003 INFO L168 Benchmark]: BlockEncodingV2 took 73.60 ms. Allocated memory is still 688.4 MB. Free memory was 637.2 MB in the beginning and 633.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,003 INFO L168 Benchmark]: TraceAbstraction took 154.57 ms. Allocated memory is still 688.4 MB. Free memory was 631.8 MB in the beginning and 623.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,004 INFO L168 Benchmark]: BuchiAutomizer took 4811.64 ms. Allocated memory was 688.4 MB in the beginning and 772.3 MB in the end (delta: 83.9 MB). Free memory was 623.5 MB in the beginning and 599.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 107.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:15:45,008 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.51 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 564.2 MB in the beginning and 655.9 MB in the end (delta: -91.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.63 ms. Allocated memory is still 688.4 MB. Free memory was 655.9 MB in the beginning and 654.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.03 ms. Allocated memory is still 688.4 MB. Free memory was 654.6 MB in the beginning and 653.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 197.64 ms. Allocated memory is still 688.4 MB. Free memory was 653.2 MB in the beginning and 637.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 73.60 ms. Allocated memory is still 688.4 MB. Free memory was 637.2 MB in the beginning and 633.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 154.57 ms. Allocated memory is still 688.4 MB. Free memory was 631.8 MB in the beginning and 623.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4811.64 ms. Allocated memory was 688.4 MB in the beginning and 772.3 MB in the end (delta: 83.9 MB). Free memory was 623.5 MB in the beginning and 599.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 107.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 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=7occurred 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 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 11 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. One nondeterministic module has affine ranking function x and consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 6 iterations. TraceHistogramMax:4. Analysis of lassos took 2.1s. Construction of modules took 0.4s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 4. Nontrivial modules had stage [4, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/26 HoareTripleCheckerStatistics: 87 SDtfs, 245 SDslu, 233 SDs, 0 SdLazy, 551 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq141 hnf94 smp100 dnf100 smp100 tf107 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:15:36.150 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 04:15:45.239 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check