YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:38:52,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:38:52,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:38:52,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:38:52,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:38:52,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:38:52,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:38:52,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:38:52,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:38:52,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:38:52,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:38:52,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:38:52,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:38:52,581 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:38:52,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:38:52,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:38:52,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:38:52,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:38:52,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:38:52,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:38:52,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:38:52,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:38:52,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:38:52,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:38:52,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:38:52,594 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:38:52,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:38:52,595 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:38:52,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:38:52,596 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:38:52,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:38:52,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:38:52,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:38:52,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:38:52,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:38:52,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:38:52,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:38:52,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:38:52,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:38:52,602 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:38:52,616 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:38:52,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:38:52,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:38:52,617 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:38:52,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:38:52,618 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:38:52,618 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:38:52,618 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:38:52,618 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:38:52,618 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:38:52,618 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:38:52,619 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:38:52,619 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:38:52,619 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:38:52,619 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:38:52,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:38:52,619 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:38:52,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:38:52,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:38:52,620 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:38:52,620 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:38:52,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:38:52,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:38:52,621 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:38:52,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:38:52,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:38:52,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:38:52,621 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:38:52,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:38:52,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:38:52,661 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:38:52,664 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:38:52,666 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:38:52,666 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:38:52,667 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:38:52,735 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2a2d68d2c47041658ee3baf542667c9c/FLAGc0cd59f71 [2020-06-22 10:38:53,073 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:38:53,074 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:38:53,080 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2a2d68d2c47041658ee3baf542667c9c/FLAGc0cd59f71 [2020-06-22 10:38:53,475 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2a2d68d2c47041658ee3baf542667c9c [2020-06-22 10:38:53,486 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:38:53,488 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:38:53,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:38:53,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:38:53,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:38:53,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8737ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53, skipping insertion in model container [2020-06-22 10:38:53,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:38:53,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:38:53,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:38:53,682 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:38:53,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:38:53,780 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:38:53,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53 WrapperNode [2020-06-22 10:38:53,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:38:53,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:38:53,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:38:53,782 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:38:53,792 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:38:53" (1/1) ... [2020-06-22 10:38:53,797 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:38:53" (1/1) ... [2020-06-22 10:38:53,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:38:53,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:38:53,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:38:53,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:38:53,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (1/1) ... [2020-06-22 10:38:53,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:38:53,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:38:53,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:38:53,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:38:53,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (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:38:53,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:38:53,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:38:54,048 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:38:54,049 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:38:54,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:54 BoogieIcfgContainer [2020-06-22 10:38:54,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:38:54,051 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:38:54,051 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:38:54,053 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:38:54,054 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:54" (1/1) ... [2020-06-22 10:38:54,070 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 10 edges [2020-06-22 10:38:54,072 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:38:54,073 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:38:54,073 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:38:54,074 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:38:54,076 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:38:54,077 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:38:54,077 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:38:54,093 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:38:54,107 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 10:38:54,113 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:38:54,115 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:38:54,128 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 10:38:54,130 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:38:54,142 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:38:54,143 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:38:54,143 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:38:54,143 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:38:54,144 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 6 edges [2020-06-22 10:38:54,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:38:54 BasicIcfg [2020-06-22 10:38:54,144 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:38:54,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:38:54,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:38:54,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:38:54,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:38:53" (1/4) ... [2020-06-22 10:38:54,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd781ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (2/4) ... [2020-06-22 10:38:54,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd781ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:54" (3/4) ... [2020-06-22 10:38:54,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd781ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:38:54" (4/4) ... [2020-06-22 10:38:54,152 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:38:54,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:38:54,171 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 10:38:54,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 10:38:54,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:38:54,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:38:54,217 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:38:54,218 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:38:54,218 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:38:54,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:38:54,219 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:38:54,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:38:54,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:38:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 10:38:54,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:38:54,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 10:38:54,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:38:54,291 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2020-06-22 10:38:54,291 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-06-22 10:38:54,292 INFO L451 ceAbstractionStarter]: At program point L12-2(lines 12 18) the Hoare annotation is: true [2020-06-22 10:38:54,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:38:54 BasicIcfg [2020-06-22 10:38:54,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:38:54,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:38:54,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:38:54,305 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:38:54,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:54,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:38:53" (1/5) ... [2020-06-22 10:38:54,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5702252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:54,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:53" (2/5) ... [2020-06-22 10:38:54,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5702252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:54,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:54" (3/5) ... [2020-06-22 10:38:54,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5702252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,308 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:54,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:38:54" (4/5) ... [2020-06-22 10:38:54,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5702252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:38:54, skipping insertion in model container [2020-06-22 10:38:54,308 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:54,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:38:54" (5/5) ... [2020-06-22 10:38:54,310 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:38:54,338 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:38:54,338 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:38:54,338 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:38:54,339 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:38:54,339 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:38:54,339 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:38:54,339 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:38:54,339 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:38:54,339 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:38:54,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 10:38:54,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:54,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:54,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:54,365 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:38:54,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:38:54,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:38:54,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 10:38:54,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:54,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:54,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:54,367 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:38:54,367 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:38:54,372 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~flag~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~flag~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true [2020-06-22 10:38:54,373 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true [37] L12-2-->L13: Formula: (> v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 6#L13true [36] L13-->L13-2: Formula: (> v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_9) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[] 5#L13-2true [29] L13-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1)) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true [2020-06-22 10:38:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times [2020-06-22 10:38:54,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:54,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:54,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 66493, now seen corresponding path program 1 times [2020-06-22 10:38:54,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:54,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:54,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:54,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:54,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1794371, now seen corresponding path program 1 times [2020-06-22 10:38:54,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:54,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:54,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:54,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:54,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:54,541 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:38:54,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:38:54,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:38:54,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:38:54,542 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:38:54,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:38:54,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:38:54,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:38:54,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 10:38:54,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:38:54,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:38:54,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,573 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:38:54,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,582 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:38:54,591 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:38:54,692 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:38:54,693 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) [2020-06-22 10:38:54,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:38:54,700 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:38:54,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:38:54,734 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:38:54,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:38:54,741 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:38:54,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:38:54,768 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:38:54,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:38:54,775 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:38:54,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:38:54,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:38:54,850 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:38:54,850 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=-1}, {ULTIMATE.start_main_~c~0=2}] Lambdas: [4, 3, 1] Nus: [0, 1] 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:38:54,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:38:54,880 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:38:54,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:38:54,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:38:55,076 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:38:55,079 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:38:55,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:38:55,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:38:55,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:38:55,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:38:55,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:38:55,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:38:55,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:38:55,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 10:38:55,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:38:55,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:38:55,082 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:38:55,086 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:38:55,090 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:38:55,094 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:38:55,102 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:38:55,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:38:55,181 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:38:55,183 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:38:55,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:55,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:55,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:55,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:55,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:55,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:55,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:55,197 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:38:55,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:55,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:55,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:55,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:55,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:55,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:55,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:55,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:55,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:55,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:55,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:55,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:55,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:55,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:55,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:55,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:55,217 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:38:55,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:55,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:55,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:55,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:55,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:55,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:55,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:55,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:38:55,232 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:38:55,232 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:38:55,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:38:55,235 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:38:55,235 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:38:55,235 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 10:38:55,237 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:38:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:38:55,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:38:55,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:55,311 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:38:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:38:55,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:55,372 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:38:55,378 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:38:55,379 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 4 states. [2020-06-22 10:38:55,469 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 4 states. Result 16 states and 26 transitions. Complement of second has 9 states. [2020-06-22 10:38:55,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 10:38:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:38:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-06-22 10:38:55,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 10:38:55,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:55,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 10:38:55,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:55,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 10:38:55,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:55,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 26 transitions. [2020-06-22 10:38:55,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:55,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 25 transitions. [2020-06-22 10:38:55,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 10:38:55,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 10:38:55,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 25 transitions. [2020-06-22 10:38:55,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:38:55,492 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 25 transitions. [2020-06-22 10:38:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 25 transitions. [2020-06-22 10:38:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2020-06-22 10:38:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 10:38:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-06-22 10:38:55,523 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 10:38:55,523 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 10:38:55,523 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:38:55,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 19 transitions. [2020-06-22 10:38:55,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:55,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:55,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:55,525 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:38:55,525 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:38:55,525 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~flag~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~flag~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 79#L12-2 [38] L12-2-->L13: Formula: (< v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 75#L13 [2020-06-22 10:38:55,526 INFO L796 eck$LassoCheckResult]: Loop: 75#L13 [30] L13-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~flag~0_8 0) (<= v_ULTIMATE.start_main_~y~0_6 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~flag~0] 80#L13-2 [29] L13-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1)) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 74#L12-2 [37] L12-2-->L13: Formula: (> v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 75#L13 [2020-06-22 10:38:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1867, now seen corresponding path program 1 times [2020-06-22 10:38:55,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,559 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:38:55,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:55,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 10:38:55,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:38:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash 59557, now seen corresponding path program 1 times [2020-06-22 10:38:55,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:55,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,576 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:38:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 10:38:55,577 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:38:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:38:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:55,581 INFO L87 Difference]: Start difference. First operand 10 states and 19 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 10:38:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:55,602 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-06-22 10:38:55,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:38:55,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. [2020-06-22 10:38:55,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:38:55,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 23 transitions. [2020-06-22 10:38:55,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 10:38:55,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 10:38:55,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2020-06-22 10:38:55,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:38:55,608 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2020-06-22 10:38:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2020-06-22 10:38:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-06-22 10:38:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:38:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-06-22 10:38:55,610 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-06-22 10:38:55,610 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-06-22 10:38:55,610 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:38:55,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 22 transitions. [2020-06-22 10:38:55,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:55,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:55,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:55,612 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:38:55,612 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:38:55,612 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~flag~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~flag~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 105#L12-2 [37] L12-2-->L13: Formula: (> v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 106#L13 [2020-06-22 10:38:55,612 INFO L796 eck$LassoCheckResult]: Loop: 106#L13 [30] L13-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~flag~0_8 0) (<= v_ULTIMATE.start_main_~y~0_6 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~flag~0] 111#L13-2 [29] L13-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1)) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 112#L12-2 [37] L12-2-->L13: Formula: (> v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 106#L13 [2020-06-22 10:38:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1866, now seen corresponding path program 1 times [2020-06-22 10:38:55,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash 59557, now seen corresponding path program 2 times [2020-06-22 10:38:55,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,636 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:38:55,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:55,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 10:38:55,637 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:38:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:38:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:55,638 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 10:38:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:55,649 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-06-22 10:38:55,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:38:55,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-06-22 10:38:55,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:55,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 10:38:55,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 10:38:55,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 10:38:55,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-06-22 10:38:55,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:38:55,654 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 10:38:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-06-22 10:38:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-06-22 10:38:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:38:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 10:38:55,655 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:38:55,656 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:38:55,656 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:38:55,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 10:38:55,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:38:55,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:55,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:55,657 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:38:55,657 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:38:55,657 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~flag~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~flag~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 143#L12-2 [37] L12-2-->L13: Formula: (> v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 139#L13 [2020-06-22 10:38:55,658 INFO L796 eck$LassoCheckResult]: Loop: 139#L13 [30] L13-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~flag~0_8 0) (<= v_ULTIMATE.start_main_~y~0_6 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~flag~0] 144#L13-2 [29] L13-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1)) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 138#L12-2 [38] L12-2-->L13: Formula: (< v_ULTIMATE.start_main_~flag~0_7 0) InVars {ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} OutVars{ULTIMATE.start_main_~flag~0=v_ULTIMATE.start_main_~flag~0_7} AuxVars[] AssignedVars[] 139#L13 [2020-06-22 10:38:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1866, now seen corresponding path program 2 times [2020-06-22 10:38:55,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:55,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:55,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:38:55,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 59558, now seen corresponding path program 1 times [2020-06-22 10:38:55,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:38:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:55,677 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:38:55,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:55,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 10:38:55,679 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:38:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:38:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:55,679 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-06-22 10:38:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:55,685 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-06-22 10:38:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:38:55,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-06-22 10:38:55,687 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:38:55,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2020-06-22 10:38:55,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:38:55,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:38:55,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:38:55,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:38:55,688 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:55,688 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:55,688 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:55,689 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:38:55,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:38:55,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:38:55,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:38:55,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:38:55 BasicIcfg [2020-06-22 10:38:55,695 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:38:55,696 INFO L168 Benchmark]: Toolchain (without parser) took 2208.91 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 565.2 MB in the beginning and 500.1 MB in the end (delta: 65.2 MB). Peak memory consumption was 106.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,698 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:38:55,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.93 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 565.2 MB in the beginning and 657.6 MB in the end (delta: -92.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.81 ms. Allocated memory is still 691.0 MB. Free memory was 657.6 MB in the beginning and 656.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,700 INFO L168 Benchmark]: Boogie Preprocessor took 20.26 ms. Allocated memory is still 691.0 MB. Free memory was 656.6 MB in the beginning and 653.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,700 INFO L168 Benchmark]: RCFGBuilder took 211.28 ms. Allocated memory is still 691.0 MB. Free memory was 652.7 MB in the beginning and 640.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,701 INFO L168 Benchmark]: BlockEncodingV2 took 93.71 ms. Allocated memory is still 691.0 MB. Free memory was 640.1 MB in the beginning and 634.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,701 INFO L168 Benchmark]: TraceAbstraction took 155.28 ms. Allocated memory is still 691.0 MB. Free memory was 634.8 MB in the beginning and 626.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,702 INFO L168 Benchmark]: BuchiAutomizer took 1394.54 ms. Allocated memory is still 691.0 MB. Free memory was 625.1 MB in the beginning and 500.1 MB in the end (delta: 125.0 MB). Peak memory consumption was 125.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:55,707 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 10 edges - StatisticsResult: Encoded RCFG 4 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 291.93 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 565.2 MB in the beginning and 657.6 MB in the end (delta: -92.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.81 ms. Allocated memory is still 691.0 MB. Free memory was 657.6 MB in the beginning and 656.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.26 ms. Allocated memory is still 691.0 MB. Free memory was 656.6 MB in the beginning and 653.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 211.28 ms. Allocated memory is still 691.0 MB. Free memory was 652.7 MB in the beginning and 640.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 93.71 ms. Allocated memory is still 691.0 MB. Free memory was 640.1 MB in the beginning and 634.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 155.28 ms. Allocated memory is still 691.0 MB. Free memory was 634.8 MB in the beginning and 626.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1394.54 ms. Allocated memory is still 691.0 MB. Free memory was 625.1 MB in the beginning and 500.1 MB in the end (delta: 125.0 MB). Peak memory consumption was 125.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 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=4occurred 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 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * x + y and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 20 SDslu, 14 SDs, 0 SdLazy, 50 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:38:50.241 ----------------------------------------------- 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:38:55.944 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check