YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:41:24,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:41:24,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:41:24,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:41:24,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:41:24,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:41:24,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:41:24,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:41:24,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:41:24,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:41:24,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:41:24,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:41:24,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:41:24,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:41:24,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:41:24,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:41:24,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:41:24,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:41:24,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:41:24,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:41:24,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:41:24,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:41:24,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:41:24,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:41:24,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:41:24,350 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:41:24,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:41:24,352 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:41:24,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:41:24,353 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:41:24,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:41:24,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:41:24,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:41:24,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:41:24,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:41:24,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:41:24,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:41:24,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:41:24,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:41:24,358 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 02:41:24,373 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:41:24,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:41:24,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:41:24,374 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:41:24,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:41:24,374 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:41:24,375 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:41:24,375 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:41:24,375 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:41:24,375 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:41:24,375 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:41:24,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:41:24,376 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:41:24,376 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:41:24,376 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:24,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:41:24,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:41:24,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:41:24,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:41:24,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:41:24,377 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:41:24,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:41:24,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:41:24,377 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:41:24,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:41:24,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:41:24,378 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:41:24,378 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:41:24,378 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:41:24,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:41:24,417 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:41:24,420 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:41:24,422 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:41:24,422 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:41:24,423 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:41:24,489 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/66061c923fbb4d248463c184566a7d20/FLAG8fc35a0de [2020-06-22 02:41:24,829 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:41:24,829 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:41:24,836 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/66061c923fbb4d248463c184566a7d20/FLAG8fc35a0de [2020-06-22 02:41:25,235 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/66061c923fbb4d248463c184566a7d20 [2020-06-22 02:41:25,246 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:41:25,247 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:41:25,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:41:25,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:41:25,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:41:25,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245a7187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25, skipping insertion in model container [2020-06-22 02:41:25,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:41:25,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:41:25,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:41:25,446 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:41:25,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:41:25,536 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:41:25,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25 WrapperNode [2020-06-22 02:41:25,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:41:25,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:41:25,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:41:25,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:41:25,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:41:25,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:41:25,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:41:25,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:41:25,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:41:25,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:41:25,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:41:25,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:41:25,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (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 02:41:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:41:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:41:25,811 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:41:25,811 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 02:41:25,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:41:25 BoogieIcfgContainer [2020-06-22 02:41:25,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:41:25,814 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:41:25,814 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:41:25,816 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:41:25,817 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:41:25" (1/1) ... [2020-06-22 02:41:25,832 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges [2020-06-22 02:41:25,834 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:41:25,835 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:41:25,835 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:41:25,836 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:41:25,838 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:41:25,838 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:41:25,839 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:41:25,855 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:41:25,872 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 02:41:25,877 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 02:41:25,879 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:41:25,890 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 02:41:25,893 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 02:41:25,894 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:41:25,894 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:41:25,895 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:41:25,895 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:41:25,895 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 11 edges [2020-06-22 02:41:25,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:41:25 BasicIcfg [2020-06-22 02:41:25,896 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:41:25,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:41:25,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:41:25,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:41:25,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:41:25" (1/4) ... [2020-06-22 02:41:25,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d5646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:41:25, skipping insertion in model container [2020-06-22 02:41:25,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (2/4) ... [2020-06-22 02:41:25,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d5646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:41:25, skipping insertion in model container [2020-06-22 02:41:25,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:41:25" (3/4) ... [2020-06-22 02:41:25,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d5646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:41:25, skipping insertion in model container [2020-06-22 02:41:25,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:41:25" (4/4) ... [2020-06-22 02:41:25,907 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:41:25,918 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:41:25,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:41:25,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:41:25,976 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:41:25,977 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:41:25,977 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:41:25,977 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:41:25,977 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:41:25,977 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:41:25,978 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:41:25,978 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:41:25,978 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:41:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 02:41:25,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:41:26,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 02:41:26,053 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2020-06-22 02:41:26,054 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:41:26,054 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 15 17) the Hoare annotation is: true [2020-06-22 02:41:26,054 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 19) no Hoare annotation was computed. [2020-06-22 02:41:26,054 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2020-06-22 02:41:26,055 INFO L451 ceAbstractionStarter]: At program point L13-2(lines 13 21) the Hoare annotation is: true [2020-06-22 02:41:26,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:41:26 BasicIcfg [2020-06-22 02:41:26,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:41:26,064 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:41:26,064 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:41:26,067 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:41:26,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:41:26,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:41:25" (1/5) ... [2020-06-22 02:41:26,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@400bc0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:41:26, skipping insertion in model container [2020-06-22 02:41:26,069 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:41:26,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:41:25" (2/5) ... [2020-06-22 02:41:26,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@400bc0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:41:26, skipping insertion in model container [2020-06-22 02:41:26,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:41:26,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:41:25" (3/5) ... [2020-06-22 02:41:26,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@400bc0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:41:26, skipping insertion in model container [2020-06-22 02:41:26,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:41:26,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:41:25" (4/5) ... [2020-06-22 02:41:26,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@400bc0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:41:26, skipping insertion in model container [2020-06-22 02:41:26,071 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:41:26,071 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:41:26" (5/5) ... [2020-06-22 02:41:26,073 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:41:26,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:41:26,102 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:41:26,102 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:41:26,102 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:41:26,102 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:41:26,102 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:41:26,103 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:41:26,103 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:41:26,103 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:41:26,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 02:41:26,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:41:26,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:26,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:26,130 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:41:26,130 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:41:26,130 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:41:26,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 02:41:26,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:41:26,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:26,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:26,132 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:41:26,132 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:41:26,138 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 4#L13-2true [2020-06-22 02:41:26,139 INFO L796 eck$LassoCheckResult]: Loop: 4#L13-2true [42] L13-2-->L14: 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[] 8#L14true [51] L14-->L14-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 5#L14-2true [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 4#L13-2true [2020-06-22 02:41:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times [2020-06-22 02:41:26,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:26,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:26,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:26,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash 71778, now seen corresponding path program 1 times [2020-06-22 02:41:26,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:26,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2127357, now seen corresponding path program 1 times [2020-06-22 02:41:26,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,296 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:26,297 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:26,297 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:26,297 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:26,298 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:41:26,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:26,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:26,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:26,298 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:41:26,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:26,299 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:26,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:26,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:26,341 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 02:41:26,345 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 02:41:26,413 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:26,414 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 02:41:26,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:26,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:26,430 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:26,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:41:26,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:26,458 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 02:41:26,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:41:26,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:26,519 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:41:26,521 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:26,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:26,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:26,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:26,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:41:26,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:41:26,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:26,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:26,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:41:26,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:26,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:26,524 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 02:41:26,528 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 02:41:26,537 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 02:41:26,541 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 02:41:26,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:26,618 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:41:26,620 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 02:41:26,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:26,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:26,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:26,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:26,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:26,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:26,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:26,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:26,628 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 02:41:26,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:26,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:26,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:26,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:26,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:26,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:26,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:26,636 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:41:26,641 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:41:26,642 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:41:26,644 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:41:26,644 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:41:26,644 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:41:26,645 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2020-06-22 02:41:26,646 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:41:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:26,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:41:26,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:26,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:26,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:26,727 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 02:41:26,758 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:41:26,763 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 2 loop predicates [2020-06-22 02:41:26,764 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. [2020-06-22 02:41:26,848 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 22 states and 43 transitions. Complement of second has 7 states. [2020-06-22 02:41:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 02:41:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 02:41:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-06-22 02:41:26,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 02:41:26,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:26,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:41:26,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:26,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 02:41:26,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:26,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 43 transitions. [2020-06-22 02:41:26,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 02:41:26,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 32 transitions. [2020-06-22 02:41:26,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 02:41:26,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 02:41:26,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 32 transitions. [2020-06-22 02:41:26,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:41:26,872 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 32 transitions. [2020-06-22 02:41:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 32 transitions. [2020-06-22 02:41:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-06-22 02:41:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 02:41:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2020-06-22 02:41:26,903 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. [2020-06-22 02:41:26,903 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. [2020-06-22 02:41:26,903 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:41:26,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 26 transitions. [2020-06-22 02:41:26,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:41:26,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:26,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:26,905 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:41:26,905 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:41:26,907 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 73#L13-2 [42] L13-2-->L14: 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[] 78#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 83#L15-2 [63] L15-2-->L15-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 84#L15-2 [2020-06-22 02:41:26,907 INFO L796 eck$LassoCheckResult]: Loop: 84#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 84#L15-2 [2020-06-22 02:41:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2127624, now seen corresponding path program 1 times [2020-06-22 02:41:26,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2020-06-22 02:41:26,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:26,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 65956406, now seen corresponding path program 1 times [2020-06-22 02:41:26,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:26,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:26,961 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:26,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:26,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:26,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:26,962 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:41:26,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:26,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:26,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:26,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:41:26,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:26,963 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:26,964 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 02:41:26,967 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 02:41:26,973 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 02:41:26,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:26,997 INFO L412 LassoAnalysis]: Checking for nontermination... 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 02:41:27,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:27,004 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:27,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:27,031 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 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 02:41:27,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:27,036 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 02:41:27,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:41:27,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:27,254 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:41:27,257 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:27,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:27,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:27,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:27,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:41:27,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:41:27,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:27,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:27,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:41:27,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:27,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:27,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:27,262 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 02:41:27,268 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 02:41:27,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:27,296 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:41:27,297 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 02:41:27,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:27,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:27,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:27,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:27,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:27,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:27,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:27,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:27,303 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 02:41:27,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:27,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:27,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:27,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:27,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:27,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:27,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:27,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:41:27,316 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:41:27,316 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:41:27,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:41:27,317 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:41:27,317 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:41:27,317 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 Supporting invariants [] [2020-06-22 02:41:27,318 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:41:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:27,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:41:27,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:27,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:27,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:41:27,360 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 02:41:27,360 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 1 loop predicates [2020-06-22 02:41:27,361 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 26 transitions. cyclomatic complexity: 14 Second operand 2 states. [2020-06-22 02:41:27,398 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 26 transitions. cyclomatic complexity: 14. Second operand 2 states. Result 20 states and 41 transitions. Complement of second has 4 states. [2020-06-22 02:41:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 02:41:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 02:41:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-06-22 02:41:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2020-06-22 02:41:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2020-06-22 02:41:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 02:41:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:27,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 41 transitions. [2020-06-22 02:41:27,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 02:41:27,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 36 transitions. [2020-06-22 02:41:27,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 02:41:27,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 02:41:27,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 36 transitions. [2020-06-22 02:41:27,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:41:27,407 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. [2020-06-22 02:41:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 36 transitions. [2020-06-22 02:41:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-06-22 02:41:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 02:41:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2020-06-22 02:41:27,410 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. [2020-06-22 02:41:27,410 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. [2020-06-22 02:41:27,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:41:27,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 34 transitions. [2020-06-22 02:41:27,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:41:27,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:27,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:27,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:41:27,413 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:41:27,413 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 141#L13-2 [42] L13-2-->L14: 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[] 146#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 151#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 152#L15-2 [2020-06-22 02:41:27,413 INFO L796 eck$LassoCheckResult]: Loop: 152#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 152#L15-2 [2020-06-22 02:41:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2127623, now seen corresponding path program 1 times [2020-06-22 02:41:27,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 2 times [2020-06-22 02:41:27,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:27,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 65956375, now seen corresponding path program 2 times [2020-06-22 02:41:27,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:41:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,460 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:27,460 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:27,460 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:27,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:27,460 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:41:27,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:27,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:27,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:27,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:41:27,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:27,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:27,462 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 02:41:27,465 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 02:41:27,471 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 02:41:27,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:27,501 INFO L412 LassoAnalysis]: Checking for nontermination... 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 02:41:27,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:27,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:27,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:27,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:41:27,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:27,542 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 02:41:27,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:41:27,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:27,770 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:41:27,773 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:27,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:27,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:27,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:27,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:41:27,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:41:27,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:27,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:27,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:41:27,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:27,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:27,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:27,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:27,785 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 02:41:27,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:27,812 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:41:27,813 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 02:41:27,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:27,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:27,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:27,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:27,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:27,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:27,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:27,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:27,817 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 02:41:27,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:27,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:27,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:27,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:27,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:27,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:27,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:27,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:41:27,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:41:27,829 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:41:27,829 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:41:27,829 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:41:27,830 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:41:27,830 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 Supporting invariants [] [2020-06-22 02:41:27,830 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:41:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:27,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:41:27,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:27,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:27,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:27,861 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 02:41:27,862 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 02:41:27,862 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 1 loop predicates [2020-06-22 02:41:27,862 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20 Second operand 2 states. [2020-06-22 02:41:27,888 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20. Second operand 2 states. Result 27 states and 69 transitions. Complement of second has 4 states. [2020-06-22 02:41:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 02:41:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 02:41:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-06-22 02:41:27,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2020-06-22 02:41:27,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:27,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2020-06-22 02:41:27,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:27,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 02:41:27,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:27,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 69 transitions. [2020-06-22 02:41:27,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 02:41:27,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 57 transitions. [2020-06-22 02:41:27,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:41:27,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 02:41:27,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 57 transitions. [2020-06-22 02:41:27,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:41:27,896 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 57 transitions. [2020-06-22 02:41:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 57 transitions. [2020-06-22 02:41:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2020-06-22 02:41:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 02:41:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2020-06-22 02:41:27,899 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. [2020-06-22 02:41:27,899 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. [2020-06-22 02:41:27,899 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:41:27,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 34 transitions. [2020-06-22 02:41:27,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:41:27,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:27,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:27,900 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:41:27,900 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 02:41:27,901 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 218#L13-2 [42] L13-2-->L14: 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[] 223#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 228#L15-2 [63] L15-2-->L15-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 229#L15-2 [2020-06-22 02:41:27,901 INFO L796 eck$LassoCheckResult]: Loop: 229#L15-2 [60] L15-2-->L15-3: Formula: (> v_ULTIMATE.start_main_~y~0_6 v_ULTIMATE.start_main_~m~0_4) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 224#L15-3 [45] L15-3-->L14-2: Formula: (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 225#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 219#L13-2 [42] L13-2-->L14: 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[] 220#L14 [58] L14-->L15-2: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 232#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 229#L15-2 [2020-06-22 02:41:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2127624, now seen corresponding path program 2 times [2020-06-22 02:41:27,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:27,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:27,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:41:27,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1646803084, now seen corresponding path program 1 times [2020-06-22 02:41:27,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:41:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2110692667, now seen corresponding path program 1 times [2020-06-22 02:41:27,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:27,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:41:27,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:41:27,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:41:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:28,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:41:28,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:41:28,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:41:28,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-06-22 02:41:28,133 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:28,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:28,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:28,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:28,133 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:41:28,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:28,134 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:28,134 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:28,134 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:41:28,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:28,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:28,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:28,137 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 02:41:28,140 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 02:41:28,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:28,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 02:41:28,156 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 02:41:28,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:28,208 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:28,209 INFO L412 LassoAnalysis]: Checking for nontermination... 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 02:41:28,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:28,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:28,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:28,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/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 02:41:28,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:28,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:28,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:28,249 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:28,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:28,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:28,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:28,280 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:28,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:28,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:28,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:28,337 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_~m~0=3} Honda state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_~m~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:28,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:28,363 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:28,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:41:28,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:28,446 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:41:28,448 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:28,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:28,448 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:28,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:28,449 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:41:28,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:41:28,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:28,449 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:28,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:41:28,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:28,449 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:28,451 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 02:41:28,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:28,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:28,469 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 02:41:28,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:28,480 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 02:41:28,483 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 02:41:28,531 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:28,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:41:28,531 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 02:41:28,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:28,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:28,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:28,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:28,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:28,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:28,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:28,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:28,535 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 02:41:28,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:28,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:28,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:28,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:28,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:28,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:28,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:28,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:28,538 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 02:41:28,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:28,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:28,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:28,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:28,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:28,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:28,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:28,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:28,543 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 02:41:28,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:28,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:28,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:28,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:28,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:28,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:28,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:28,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:28,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:41:28,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:28,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:28,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:28,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:28,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:28,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:28,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:28,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:41:28,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:41:28,554 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:41:28,554 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:41:28,554 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:41:28,554 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:41:28,554 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 02:41:28,555 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:41:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:28,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:41:28,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:28,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:28,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:41:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:28,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:28,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:28,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:28,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:28,642 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:41:28,642 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 02:41:28,642 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-06-22 02:41:28,742 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 86 states and 241 transitions. Complement of second has 31 states. [2020-06-22 02:41:28,742 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 02:41:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 02:41:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-06-22 02:41:28,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 02:41:28,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:28,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 02:41:28,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:28,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 02:41:28,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:28,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 241 transitions. [2020-06-22 02:41:28,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 02:41:28,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 51 states and 117 transitions. [2020-06-22 02:41:28,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 02:41:28,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 02:41:28,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 117 transitions. [2020-06-22 02:41:28,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:41:28,754 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 117 transitions. [2020-06-22 02:41:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 117 transitions. [2020-06-22 02:41:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2020-06-22 02:41:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 02:41:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 69 transitions. [2020-06-22 02:41:28,759 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 69 transitions. [2020-06-22 02:41:28,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 02:41:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-06-22 02:41:28,763 INFO L87 Difference]: Start difference. First operand 33 states and 69 transitions. Second operand 9 states. [2020-06-22 02:41:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:41:28,917 INFO L93 Difference]: Finished difference Result 89 states and 158 transitions. [2020-06-22 02:41:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:41:28,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 158 transitions. [2020-06-22 02:41:28,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-06-22 02:41:28,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 69 states and 132 transitions. [2020-06-22 02:41:28,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-06-22 02:41:28,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-06-22 02:41:28,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 132 transitions. [2020-06-22 02:41:28,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:41:28,924 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 132 transitions. [2020-06-22 02:41:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 132 transitions. [2020-06-22 02:41:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2020-06-22 02:41:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-06-22 02:41:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2020-06-22 02:41:28,929 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 104 transitions. [2020-06-22 02:41:28,930 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 104 transitions. [2020-06-22 02:41:28,930 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:41:28,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 104 transitions. [2020-06-22 02:41:28,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-06-22 02:41:28,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:28,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:28,932 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:41:28,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 02:41:28,932 INFO L794 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 601#L13-2 [42] L13-2-->L14: 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[] 629#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 635#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 636#L15-2 [2020-06-22 02:41:28,932 INFO L796 eck$LassoCheckResult]: Loop: 636#L15-2 [61] L15-2-->L15-3: 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] 641#L15-3 [45] L15-3-->L14-2: Formula: (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 645#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 643#L13-2 [42] L13-2-->L14: 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[] 644#L14 [58] L14-->L15-2: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 646#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 636#L15-2 [2020-06-22 02:41:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2127623, now seen corresponding path program 3 times [2020-06-22 02:41:28,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:28,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:28,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:28,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1618173933, now seen corresponding path program 1 times [2020-06-22 02:41:28,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:28,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:28,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:28,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:41:28,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1251818137, now seen corresponding path program 1 times [2020-06-22 02:41:28,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:28,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:28,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:28,989 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:28,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:28,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:28,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:28,990 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:41:28,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:28,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:28,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:28,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:41:28,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:28,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:28,992 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 02:41:28,995 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 02:41:29,000 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 02:41:29,001 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 02:41:29,007 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 02:41:29,009 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 02:41:29,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:29,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:29,054 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:29,058 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:29,085 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:29,085 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=1} Honda state: {ULTIMATE.start_main_#t~nondet1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:29,090 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:41:29,119 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:29,171 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:41:29,173 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:29,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:29,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:29,173 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:29,174 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:41:29,174 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:41:29,174 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:29,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:29,174 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:41:29,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:29,174 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:29,175 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 02:41:29,178 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 02:41:29,183 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 02:41:29,185 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 02:41:29,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:29,193 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 02:41:29,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:41:29,239 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:29,240 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:41:29,240 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 02:41:29,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:29,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:29,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:29,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:29,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:29,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:29,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:29,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:41:29,244 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 02:41:29,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:29,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:29,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:29,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:29,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:29,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:29,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:29,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:41:29,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:41:29,250 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:41:29,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:41:29,251 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:41:29,251 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:41:29,251 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 02:41:29,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:41:29,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:41:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,337 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:41:29,337 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 02:41:29,337 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 51 states and 104 transitions. cyclomatic complexity: 61 Second operand 5 states. [2020-06-22 02:41:29,429 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 51 states and 104 transitions. cyclomatic complexity: 61. Second operand 5 states. Result 354 states and 811 transitions. Complement of second has 31 states. [2020-06-22 02:41:29,430 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 02:41:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 02:41:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-06-22 02:41:29,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 02:41:29,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:29,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 02:41:29,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:29,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 02:41:29,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:29,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 811 transitions. [2020-06-22 02:41:29,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2020-06-22 02:41:29,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 201 states and 397 transitions. [2020-06-22 02:41:29,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 02:41:29,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-06-22 02:41:29,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 397 transitions. [2020-06-22 02:41:29,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:41:29,447 INFO L706 BuchiCegarLoop]: Abstraction has 201 states and 397 transitions. [2020-06-22 02:41:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 397 transitions. [2020-06-22 02:41:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 35. [2020-06-22 02:41:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 02:41:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 65 transitions. [2020-06-22 02:41:29,453 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 65 transitions. [2020-06-22 02:41:29,453 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 65 transitions. [2020-06-22 02:41:29,453 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:41:29,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 65 transitions. [2020-06-22 02:41:29,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:41:29,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:41:29,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:41:29,455 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:41:29,455 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:41:29,455 INFO L794 eck$LassoCheckResult]: Stem: 1120#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 1121#L13-2 [42] L13-2-->L14: 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[] 1138#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1139#L15-2 [63] L15-2-->L15-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 1130#L15-2 [61] L15-2-->L15-3: 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] 1131#L15-3 [45] L15-3-->L14-2: Formula: (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 1152#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 1151#L13-2 [42] L13-2-->L14: 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[] 1145#L14 [51] L14-->L14-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1126#L14-2 [2020-06-22 02:41:29,456 INFO L796 eck$LassoCheckResult]: Loop: 1126#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 1122#L13-2 [42] L13-2-->L14: 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[] 1123#L14 [51] L14-->L14-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1126#L14-2 [2020-06-22 02:41:29,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash 900294365, now seen corresponding path program 1 times [2020-06-22 02:41:29,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:29,467 INFO L82 PathProgramCache]: Analyzing trace with hash 73428, now seen corresponding path program 2 times [2020-06-22 02:41:29,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:29,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:29,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:29,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:41:29,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:41:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1401292168, now seen corresponding path program 2 times [2020-06-22 02:41:29,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:41:29,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:41:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:29,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:41:29,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:41:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:41:29,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:41:29,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:41:29,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:41:29,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:41:29,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:41:29,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:41:29,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:41:29,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 02:41:29,567 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:29,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:29,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:29,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:29,568 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:41:29,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:29,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:29,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:41:29,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:29,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:29,569 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 02:41:29,571 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 02:41:29,575 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 02:41:29,577 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 02:41:29,602 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:29,603 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:29,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:29,609 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:41:29,609 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:41:29,637 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:41:29,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:41:29,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:41:29,718 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:41:29,720 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:41:29,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:41:29,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:41:29,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:41:29,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:41:29,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:41:29,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:41:29,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:41:29,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:41:29,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:41:29,721 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:41:29,722 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 02:41:29,727 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 02:41:29,729 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 02:41:29,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 02:41:29,755 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:41:29,755 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:41:29,755 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 02:41:29,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:41:29,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:41:29,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:41:29,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:41:29,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:41:29,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:41:29,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:41:29,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:41:29,762 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:41:29,762 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:41:29,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:41:29,763 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:41:29,763 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:41:29,763 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 02:41:29,764 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:41:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:41:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,801 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 02:41:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:41:29,811 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:41:29,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:41:29,813 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:41:29,813 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 02:41:29,813 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 65 transitions. cyclomatic complexity: 35 Second operand 4 states. [2020-06-22 02:41:29,878 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 65 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 138 states and 250 transitions. Complement of second has 16 states. [2020-06-22 02:41:29,878 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 02:41:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:41:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-06-22 02:41:29,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 02:41:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:29,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 12 letters. Loop has 3 letters. [2020-06-22 02:41:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:29,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 02:41:29,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:41:29,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 250 transitions. [2020-06-22 02:41:29,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:41:29,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 0 states and 0 transitions. [2020-06-22 02:41:29,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:41:29,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:41:29,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:41:29,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:41:29,884 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:41:29,884 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:41:29,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:41:29,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:41:29,884 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2020-06-22 02:41:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:41:29,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-06-22 02:41:29,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 02:41:29,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-06-22 02:41:29,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:41:29,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 02:41:29,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:41:29,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:41:29,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:41:29,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:41:29,886 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:41:29,886 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:41:29,887 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:41:29,887 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:41:29,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:41:29,887 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:41:29,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:41:29,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:41:29 BasicIcfg [2020-06-22 02:41:29,893 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:41:29,894 INFO L168 Benchmark]: Toolchain (without parser) took 4647.18 ms. Allocated memory was 649.6 MB in the beginning and 754.5 MB in the end (delta: 104.9 MB). Free memory was 560.7 MB in the beginning and 450.5 MB in the end (delta: 110.3 MB). Peak memory consumption was 215.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,895 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:41:29,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.97 ms. Allocated memory was 649.6 MB in the beginning and 681.1 MB in the end (delta: 31.5 MB). Free memory was 560.7 MB in the beginning and 646.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.94 ms. Allocated memory is still 681.1 MB. Free memory was 646.8 MB in the beginning and 645.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,897 INFO L168 Benchmark]: Boogie Preprocessor took 20.36 ms. Allocated memory is still 681.1 MB. Free memory was 645.7 MB in the beginning and 644.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,897 INFO L168 Benchmark]: RCFGBuilder took 218.38 ms. Allocated memory is still 681.1 MB. Free memory was 644.6 MB in the beginning and 628.2 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,898 INFO L168 Benchmark]: BlockEncodingV2 took 82.61 ms. Allocated memory is still 681.1 MB. Free memory was 628.2 MB in the beginning and 623.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,898 INFO L168 Benchmark]: TraceAbstraction took 166.09 ms. Allocated memory is still 681.1 MB. Free memory was 622.8 MB in the beginning and 614.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,899 INFO L168 Benchmark]: BuchiAutomizer took 3829.55 ms. Allocated memory was 681.1 MB in the beginning and 754.5 MB in the end (delta: 73.4 MB). Free memory was 614.1 MB in the beginning and 450.5 MB in the end (delta: 163.6 MB). Peak memory consumption was 237.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:41:29,903 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 6 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 288.97 ms. Allocated memory was 649.6 MB in the beginning and 681.1 MB in the end (delta: 31.5 MB). Free memory was 560.7 MB in the beginning and 646.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.94 ms. Allocated memory is still 681.1 MB. Free memory was 646.8 MB in the beginning and 645.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.36 ms. Allocated memory is still 681.1 MB. Free memory was 645.7 MB in the beginning and 644.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 218.38 ms. Allocated memory is still 681.1 MB. Free memory was 644.6 MB in the beginning and 628.2 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 82.61 ms. Allocated memory is still 681.1 MB. Free memory was 628.2 MB in the beginning and 623.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 166.09 ms. Allocated memory is still 681.1 MB. Free memory was 622.8 MB in the beginning and 614.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3829.55 ms. Allocated memory was 681.1 MB in the beginning and 754.5 MB in the end (delta: 73.4 MB). Free memory was 614.1 MB in the beginning and 450.5 MB in the end (delta: 163.6 MB). Peak memory consumption was 237.0 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 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=6occurred 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 3 locations. One nondeterministic module has affine ranking function x 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 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 215 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 4. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 44 SDtfs, 169 SDslu, 114 SDs, 0 SdLazy, 276 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf112 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:41:21.969 ----------------------------------------------- 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 02:41:30.135 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check