YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:48:24,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:48:24,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:48:24,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:48:24,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:48:24,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:48:24,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:48:24,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:48:24,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:48:24,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:48:24,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:48:24,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:48:24,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:48:24,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:48:24,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:48:24,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:48:24,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:48:24,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:48:24,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:48:24,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:48:24,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:48:24,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:48:24,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:48:24,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:48:24,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:48:24,424 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:48:24,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:48:24,426 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:48:24,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:48:24,427 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:48:24,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:48:24,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:48:24,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:48:24,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:48:24,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:48:24,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:48:24,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:48:24,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:48:24,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:48:24,432 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:48:24,446 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:48:24,446 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:48:24,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:48:24,448 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:48:24,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:48:24,448 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:48:24,448 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:48:24,449 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:48:24,449 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:48:24,449 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:48:24,449 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:48:24,449 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:48:24,449 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:48:24,450 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:48:24,450 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:24,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:48:24,450 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:48:24,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:48:24,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:48:24,451 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:48:24,451 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:48:24,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:48:24,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:48:24,451 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:48:24,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:48:24,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:48:24,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:48:24,452 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:48:24,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:48:24,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:48:24,490 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:48:24,494 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:48:24,495 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:48:24,496 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:48:24,496 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:48:24,561 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/92fa9d2a94154ed090797e3caf279c24/FLAG75f929851 [2020-06-22 10:48:24,896 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:48:24,897 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:48:24,904 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/92fa9d2a94154ed090797e3caf279c24/FLAG75f929851 [2020-06-22 10:48:25,314 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/92fa9d2a94154ed090797e3caf279c24 [2020-06-22 10:48:25,327 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:48:25,328 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:48:25,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:48:25,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:48:25,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:48:25,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6462c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25, skipping insertion in model container [2020-06-22 10:48:25,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:48:25,363 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:48:25,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:48:25,520 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:48:25,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:48:25,602 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:48:25,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25 WrapperNode [2020-06-22 10:48:25,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:48:25,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:48:25,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:48:25,604 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:48:25,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:48:25,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:48:25,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:48:25,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:48:25,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:48:25,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:48:25,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:48:25,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:48:25,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48: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 10:48:25,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:48:25,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:48:25,852 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:48:25,853 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:48:25,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:25 BoogieIcfgContainer [2020-06-22 10:48:25,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:48:25,855 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:48:25,855 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:48:25,857 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:48:25,858 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:25" (1/1) ... [2020-06-22 10:48:25,872 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges [2020-06-22 10:48:25,873 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:48:25,874 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:48:25,875 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:48:25,875 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:48:25,877 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:48:25,878 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:48:25,878 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:48:25,892 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:48:25,907 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 10:48:25,911 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:48:25,913 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:48:25,923 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 10:48:25,925 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 10:48:25,926 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:48:25,926 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:48:25,926 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:48:25,927 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:48:25,927 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-22 10:48:25,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:25 BasicIcfg [2020-06-22 10:48:25,928 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:48:25,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:48:25,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:48:25,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:48:25,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:48:25" (1/4) ... [2020-06-22 10:48:25,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b85d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:25, skipping insertion in model container [2020-06-22 10:48:25,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (2/4) ... [2020-06-22 10:48:25,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b85d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:48:25, skipping insertion in model container [2020-06-22 10:48:25,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:25" (3/4) ... [2020-06-22 10:48:25,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b85d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:25, skipping insertion in model container [2020-06-22 10:48:25,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:25" (4/4) ... [2020-06-22 10:48:25,936 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:48:25,945 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:48:25,954 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 10:48:25,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 10:48:25,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:48:26,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:48:26,000 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:48:26,000 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:48:26,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:48:26,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:48:26,001 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:48:26,001 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:48:26,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:48:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 10:48:26,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:48:26,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 10:48:26,071 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:48:26,072 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2020-06-22 10:48:26,072 INFO L451 ceAbstractionStarter]: At program point L21-2(lines 20 30) the Hoare annotation is: true [2020-06-22 10:48:26,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:26 BasicIcfg [2020-06-22 10:48:26,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:48:26,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:48:26,082 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:48:26,085 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:48:26,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:26,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:48:25" (1/5) ... [2020-06-22 10:48:26,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1195a670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:48:26, skipping insertion in model container [2020-06-22 10:48:26,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:26,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:48:25" (2/5) ... [2020-06-22 10:48:26,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1195a670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:48:26, skipping insertion in model container [2020-06-22 10:48:26,088 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:26,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:48:25" (3/5) ... [2020-06-22 10:48:26,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1195a670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:26, skipping insertion in model container [2020-06-22 10:48:26,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:26,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:48:25" (4/5) ... [2020-06-22 10:48:26,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1195a670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:26, skipping insertion in model container [2020-06-22 10:48:26,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:48:26,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:48:26" (5/5) ... [2020-06-22 10:48:26,091 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:48:26,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:48:26,118 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:48:26,119 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:48:26,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:48:26,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:48:26,119 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:48:26,119 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:48:26,120 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:48:26,120 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:48:26,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 10:48:26,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:48:26,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:26,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:26,148 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:48:26,148 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:26,148 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:48:26,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 10:48:26,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:48:26,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:26,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:26,149 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:48:26,149 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:26,154 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [27] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 5#L21-2true [2020-06-22 10:48:26,155 INFO L796 eck$LassoCheckResult]: Loop: 5#L21-2true [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 3#L21true [34] L21-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet4_3|) (>= v_ULTIMATE.start_main_~x~0_11 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~z~0_10 (+ v_ULTIMATE.start_main_~z~0_11 (- 1))) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 5#L21-2true [2020-06-22 10:48:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2020-06-22 10:48:26,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:26,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:26,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:26,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 1 times [2020-06-22 10:48:26,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:26,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash 56733, now seen corresponding path program 1 times [2020-06-22 10:48:26,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:26,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:26,354 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:26,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:26,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:26,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:26,356 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:48:26,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:26,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:26,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:26,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 10:48:26,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:26,357 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:26,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:26,553 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 10:48:26,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:26,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:26,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:48:26,593 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/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 10:48:26,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:26,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:26,629 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:48:26,629 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/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 10:48:26,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:26,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:26,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:48:26,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=5, ULTIMATE.start_main_#t~nondet4=6, ULTIMATE.start_main_~x~0=6} Honda state: {ULTIMATE.start_main_~y~0=5, ULTIMATE.start_main_#t~nondet4=6, ULTIMATE.start_main_~x~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 10:48:26,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:26,669 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 10:48:26,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:48:26,701 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:26,731 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:48:26,734 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:26,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:26,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:26,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:26,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:26,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:26,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:26,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:26,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 10:48:26,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:26,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:26,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:26,831 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:26,837 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:26,839 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 10:48:26,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:26,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:26,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:26,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:26,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:26,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:26,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:26,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:48:26,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:26,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:26,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:26,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:26,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:26,867 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 10:48:26,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:26,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:26,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:26,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:26,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:26,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:26,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:26,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:26,881 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 10:48:26,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:26,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:26,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:26,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:26,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:26,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:26,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:26,888 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:26,893 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:48:26,893 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:48:26,896 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:26,896 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:48:26,897 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:26,897 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-06-22 10:48:26,898 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:48:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:26,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:26,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:26,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:26,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:26,967 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 10:48:26,993 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:48:26,998 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 10:48:26,999 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-06-22 10:48:27,036 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. [2020-06-22 10:48:27,037 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 10:48:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 10:48:27,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 10:48:27,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:27,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:48:27,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:27,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 10:48:27,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:27,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. [2020-06-22 10:48:27,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:48:27,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 10:48:27,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 10:48:27,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 10:48:27,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-06-22 10:48:27,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:27,057 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 10:48:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-06-22 10:48:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 10:48:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:48:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 10:48:27,086 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 10:48:27,086 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 10:48:27,087 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:48:27,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-06-22 10:48:27,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:48:27,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:27,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:27,088 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:48:27,088 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:27,089 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 48#L21-2 [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 43#L21 [25] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_9 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 44#L21-2 [2020-06-22 10:48:27,089 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 49#L21 [34] L21-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet4_3|) (>= v_ULTIMATE.start_main_~x~0_11 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~z~0_10 (+ v_ULTIMATE.start_main_~z~0_11 (- 1))) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 44#L21-2 [2020-06-22 10:48:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash 56724, now seen corresponding path program 1 times [2020-06-22 10:48:27,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 2 times [2020-06-22 10:48:27,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:27,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash 54512759, now seen corresponding path program 1 times [2020-06-22 10:48:27,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:27,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:27,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:27,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,170 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:27,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:27,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:27,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:27,171 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:48:27,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:27,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:27,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:27,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 10:48:27,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:27,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:27,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,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 10:48:27,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,293 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:27,293 INFO L412 LassoAnalysis]: Checking for nontermination... 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 10:48:27,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:27,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:27,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:48:27,332 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/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 10:48:27,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:27,338 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 10:48:27,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:48:27,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:27,399 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:48:27,402 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:27,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:27,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:27,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:27,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:27,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:27,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:27,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:27,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 10:48:27,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:27,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:27,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,490 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:27,490 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:27,491 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 10:48:27,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:27,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:27,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:27,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:27,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:27,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:27,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:27,499 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 10:48:27,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:27,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:27,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:27,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:27,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:27,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:27,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:27,504 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:27,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:48:27,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:48:27,508 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:27,508 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:48:27,508 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:27,508 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-06-22 10:48:27,509 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:48:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:27,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:27,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:27,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:48:27,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:27,557 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 10:48:27,570 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:48:27,570 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 10:48:27,571 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-06-22 10:48:27,594 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. [2020-06-22 10:48:27,595 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 10:48:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 10:48:27,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:48:27,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:27,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 10:48:27,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:27,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 10:48:27,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:27,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2020-06-22 10:48:27,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:48:27,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2020-06-22 10:48:27,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 10:48:27,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 10:48:27,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-06-22 10:48:27,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:27,600 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-06-22 10:48:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-06-22 10:48:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. [2020-06-22 10:48:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:48:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-06-22 10:48:27,602 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-22 10:48:27,602 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-22 10:48:27,602 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:48:27,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2020-06-22 10:48:27,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:48:27,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:27,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:27,603 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:48:27,603 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:27,604 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 96#L21-2 [2020-06-22 10:48:27,604 INFO L796 eck$LassoCheckResult]: Loop: 96#L21-2 [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 95#L21 [25] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_9 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 96#L21-2 [2020-06-22 10:48:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 2 times [2020-06-22 10:48:27,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:27,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1947, now seen corresponding path program 1 times [2020-06-22 10:48:27,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:27,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:27,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:27,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 56724, now seen corresponding path program 2 times [2020-06-22 10:48:27,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:27,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:27,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:48:27,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:27,672 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:27,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:27,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:27,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:27,673 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:48:27,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:27,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:27,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:27,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 10:48:27,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:27,674 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:27,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:27,769 INFO L412 LassoAnalysis]: Checking for nontermination... 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 10:48:27,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:27,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:27,801 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:48:27,801 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:27,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:27,806 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 10:48:27,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:48:27,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:27,947 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:48:27,950 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:27,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:27,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:27,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:27,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:27,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:27,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:27,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:27,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 10:48:27,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:27,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:27,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:27,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:28,043 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:28,043 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:28,043 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 10:48:28,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:28,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:28,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:28,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:28,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:28,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:28,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:28,051 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 10:48:28,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:28,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:28,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:28,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:28,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:28,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:28,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:28,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:28,073 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:48:28,074 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:48:28,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:28,075 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:48:28,075 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:28,075 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~z~0 + 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 10:48:28,076 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:48:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:28,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:28,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:28,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:48:28,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:28,112 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 10:48:28,122 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:48:28,122 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 10:48:28,122 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-06-22 10:48:28,135 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 4 states. [2020-06-22 10:48:28,135 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 10:48:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 10:48:28,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 10:48:28,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:28,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:48:28,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:28,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 10:48:28,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:28,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2020-06-22 10:48:28,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:48:28,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2020-06-22 10:48:28,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 10:48:28,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 10:48:28,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-06-22 10:48:28,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:28,140 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-06-22 10:48:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-06-22 10:48:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-06-22 10:48:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 10:48:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 10:48:28,142 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 10:48:28,142 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 10:48:28,142 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:48:28,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-06-22 10:48:28,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:48:28,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:48:28,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:48:28,144 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-22 10:48:28,145 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:48:28,145 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 146#L21-2 [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 147#L21 [34] L21-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_10 |v_ULTIMATE.start_main_#t~nondet4_3|) (>= v_ULTIMATE.start_main_~x~0_11 v_ULTIMATE.start_main_~y~0_11) (= v_ULTIMATE.start_main_~z~0_10 (+ v_ULTIMATE.start_main_~z~0_11 (- 1))) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 148#L21-2 [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 141#L21 [2020-06-22 10:48:28,145 INFO L796 eck$LassoCheckResult]: Loop: 141#L21 [25] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~x~0_9 v_ULTIMATE.start_main_~y~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~x~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 142#L21-2 [31] L21-2-->L21: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 141#L21 [2020-06-22 10:48:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1758754, now seen corresponding path program 2 times [2020-06-22 10:48:28,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:28,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:28,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1767, now seen corresponding path program 2 times [2020-06-22 10:48:28,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:28,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:28,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:48:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1690163400, now seen corresponding path program 2 times [2020-06-22 10:48:28,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:48:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:48:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:28,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:48:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:48:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:48:28,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:48:28,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:48:28,233 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:28,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:28,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:28,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:28,234 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:48:28,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:48:28,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:28,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:28,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 10:48:28,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:28,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:28,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:28,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:28,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:28,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:28,298 INFO L412 LassoAnalysis]: Checking for nontermination... 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 10:48:28,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:28,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:28,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:48:28,331 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} 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 10:48:28,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:48:28,335 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 10:48:28,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:48:28,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:48:33,712 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:48:33,715 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:48:33,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:48:33,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:48:33,716 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:48:33,716 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:48:33,716 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:48:33,716 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:48:33,716 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:48:33,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 10:48:33,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:48:33,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:48:33,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:33,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:33,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:48:33,782 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:48:33,783 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:48:33,783 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 10:48:33,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:33,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:33,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:33,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:33,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:48:33,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:48:33,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:48:33,790 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 10:48:33,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:48:33,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:48:33,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:48:33,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:48:33,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:48:33,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:48:33,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:48:33,799 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:48:33,805 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:48:33,805 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:48:33,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:48:33,806 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:48:33,806 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:48:33,806 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~z~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 10:48:33,806 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:48:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:48:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:33,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:48:33,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:48:33,835 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:48:33,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:48:33,865 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 10:48:33,886 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:48:33,886 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 10:48:33,886 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-06-22 10:48:33,950 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 5 states. [2020-06-22 10:48:33,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 10:48:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:48:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-06-22 10:48:33,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 10:48:33,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:33,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:48:33,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:33,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 10:48:33,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:48:33,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2020-06-22 10:48:33,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:48:33,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2020-06-22 10:48:33,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-06-22 10:48:33,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-06-22 10:48:33,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-06-22 10:48:33,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:48:33,956 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:48:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-06-22 10:48:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 7. [2020-06-22 10:48:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:48:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 10:48:33,957 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 10:48:33,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:48:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:48:33,961 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 3 states. [2020-06-22 10:48:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:48:33,977 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-06-22 10:48:33,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:48:33,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 10 transitions. [2020-06-22 10:48:33,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:48:33,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2020-06-22 10:48:33,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:48:33,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:48:33,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:48:33,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:48:33,979 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:33,979 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:33,980 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:48:33,980 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:48:33,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:48:33,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:48:33,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:48:33,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:48:33 BasicIcfg [2020-06-22 10:48:33,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:48:33,986 INFO L168 Benchmark]: Toolchain (without parser) took 8659.00 ms. Allocated memory was 514.9 MB in the beginning and 586.7 MB in the end (delta: 71.8 MB). Free memory was 439.6 MB in the beginning and 534.4 MB in the end (delta: -94.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:33,988 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 460.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:33,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.24 ms. Allocated memory was 514.9 MB in the beginning and 545.8 MB in the end (delta: 30.9 MB). Free memory was 439.6 MB in the beginning and 516.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:33,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.81 ms. Allocated memory is still 545.8 MB. Free memory was 516.1 MB in the beginning and 513.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:33,990 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 ms. Allocated memory is still 545.8 MB. Free memory was 513.1 MB in the beginning and 512.4 MB in the end (delta: 674.0 kB). Peak memory consumption was 674.0 kB. Max. memory is 50.3 GB. [2020-06-22 10:48:33,990 INFO L168 Benchmark]: RCFGBuilder took 196.85 ms. Allocated memory is still 545.8 MB. Free memory was 512.4 MB in the beginning and 501.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:33,991 INFO L168 Benchmark]: BlockEncodingV2 took 72.97 ms. Allocated memory is still 545.8 MB. Free memory was 501.2 MB in the beginning and 496.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:33,991 INFO L168 Benchmark]: TraceAbstraction took 152.65 ms. Allocated memory is still 545.8 MB. Free memory was 495.8 MB in the beginning and 486.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:48:33,992 INFO L168 Benchmark]: BuchiAutomizer took 7904.06 ms. Allocated memory was 545.8 MB in the beginning and 586.7 MB in the end (delta: 40.9 MB). Free memory was 486.8 MB in the beginning and 534.4 MB in the end (delta: -47.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:48:33,996 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 7 locations, 9 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 460.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 274.24 ms. Allocated memory was 514.9 MB in the beginning and 545.8 MB in the end (delta: 30.9 MB). Free memory was 439.6 MB in the beginning and 516.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.81 ms. Allocated memory is still 545.8 MB. Free memory was 516.1 MB in the beginning and 513.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.24 ms. Allocated memory is still 545.8 MB. Free memory was 513.1 MB in the beginning and 512.4 MB in the end (delta: 674.0 kB). Peak memory consumption was 674.0 kB. Max. memory is 50.3 GB. * RCFGBuilder took 196.85 ms. Allocated memory is still 545.8 MB. Free memory was 512.4 MB in the beginning and 501.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 72.97 ms. Allocated memory is still 545.8 MB. Free memory was 501.2 MB in the beginning and 496.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 152.65 ms. Allocated memory is still 545.8 MB. Free memory was 495.8 MB in the beginning and 486.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 7904.06 ms. Allocated memory was 545.8 MB in the beginning and 586.7 MB in the end (delta: 40.9 MB). Free memory was 486.8 MB in the beginning and 534.4 MB in the end (delta: -47.7 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 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=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function z and consists of 3 locations. One nondeterministic module has affine ranking function z and consists of 3 locations. One nondeterministic module has affine ranking function z + y + -1 * x and consists of 3 locations. One nondeterministic module has affine ranking function y + z + -1 * x and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 20 SDslu, 0 SDs, 0 SdLazy, 53 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf91 smp100 dnf100 smp100 tf107 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:48:22.059 ----------------------------------------------- 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 10:48:34.227 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check