YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 06:54:37,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 06:54:37,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 06:54:37,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 06:54:37,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 06:54:37,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 06:54:37,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 06:54:37,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 06:54:37,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 06:54:37,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 06:54:37,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 06:54:37,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 06:54:37,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 06:54:37,540 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 06:54:37,541 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 06:54:37,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 06:54:37,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 06:54:37,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 06:54:37,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 06:54:37,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 06:54:37,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 06:54:37,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 06:54:37,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 06:54:37,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 06:54:37,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 06:54:37,553 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 06:54:37,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 06:54:37,554 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 06:54:37,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 06:54:37,555 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 06:54:37,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 06:54:37,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 06:54:37,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 06:54:37,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 06:54:37,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 06:54:37,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 06:54:37,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 06:54:37,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 06:54:37,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 06:54:37,560 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 06:54:37,574 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 06:54:37,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 06:54:37,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 06:54:37,575 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 06:54:37,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 06:54:37,576 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:54:37,576 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 06:54:37,576 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 06:54:37,576 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 06:54:37,576 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 06:54:37,577 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 06:54:37,577 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 06:54:37,577 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 06:54:37,577 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 06:54:37,577 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:37,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 06:54:37,577 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 06:54:37,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 06:54:37,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 06:54:37,578 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 06:54:37,578 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 06:54:37,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 06:54:37,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 06:54:37,579 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 06:54:37,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:54:37,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 06:54:37,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 06:54:37,579 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 06:54:37,579 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 06:54:37,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 06:54:37,618 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 06:54:37,621 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 06:54:37,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 06:54:37,623 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 06:54:37,624 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:54:37,732 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/4f4da6cc2d6a4b8097617f2fdf791aca/FLAG5ac7ba5a2 [2020-06-22 06:54:38,065 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 06:54:38,066 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:54:38,072 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/4f4da6cc2d6a4b8097617f2fdf791aca/FLAG5ac7ba5a2 [2020-06-22 06:54:38,470 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/4f4da6cc2d6a4b8097617f2fdf791aca [2020-06-22 06:54:38,482 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 06:54:38,483 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 06:54:38,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 06:54:38,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 06:54:38,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 06:54:38,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4742c44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38, skipping insertion in model container [2020-06-22 06:54:38,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 06:54:38,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 06:54:38,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:54:38,677 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 06:54:38,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:54:38,776 INFO L195 MainTranslator]: Completed translation [2020-06-22 06:54:38,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38 WrapperNode [2020-06-22 06:54:38,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 06:54:38,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 06:54:38,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 06:54:38,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 06:54:38,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 06:54:38,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 06:54:38,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 06:54:38,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 06:54:38,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... [2020-06-22 06:54:38,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 06:54:38,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 06:54:38,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 06:54:38,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 06:54:38,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:54:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 06:54:38,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 06:54:39,049 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 06:54:39,049 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 06:54:39,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:54:39 BoogieIcfgContainer [2020-06-22 06:54:39,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 06:54:39,051 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 06:54:39,051 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 06:54:39,054 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 06:54:39,055 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:54:39" (1/1) ... [2020-06-22 06:54:39,070 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges [2020-06-22 06:54:39,072 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 06:54:39,073 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 06:54:39,073 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 06:54:39,074 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:54:39,075 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 06:54:39,077 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 06:54:39,077 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 06:54:39,093 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 06:54:39,110 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 06:54:39,115 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 06:54:39,117 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:54:39,133 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 06:54:39,135 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 06:54:39,136 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:54:39,137 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:54:39,137 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 06:54:39,137 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 06:54:39,137 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 9 edges [2020-06-22 06:54:39,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:54:39 BasicIcfg [2020-06-22 06:54:39,138 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 06:54:39,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 06:54:39,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 06:54:39,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 06:54:39,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 06:54:38" (1/4) ... [2020-06-22 06:54:39,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4793eee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (2/4) ... [2020-06-22 06:54:39,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4793eee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:54:39" (3/4) ... [2020-06-22 06:54:39,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4793eee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:54:39" (4/4) ... [2020-06-22 06:54:39,147 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:54:39,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 06:54:39,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 06:54:39,185 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 06:54:39,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:54:39,214 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 06:54:39,214 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 06:54:39,214 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:54:39,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:54:39,214 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:54:39,214 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 06:54:39,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:54:39,215 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 06:54:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 06:54:39,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 06:54:39,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 06:54:39,293 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 17 28) no Hoare annotation was computed. [2020-06-22 06:54:39,293 INFO L451 ceAbstractionStarter]: At program point L16-2(lines 16 31) the Hoare annotation is: true [2020-06-22 06:54:39,293 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 06:54:39,294 INFO L451 ceAbstractionStarter]: At program point L23-1(lines 17 28) the Hoare annotation is: true [2020-06-22 06:54:39,294 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 22) no Hoare annotation was computed. [2020-06-22 06:54:39,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:54:39 BasicIcfg [2020-06-22 06:54:39,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 06:54:39,304 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 06:54:39,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 06:54:39,307 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 06:54:39,308 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:54:39,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 06:54:38" (1/5) ... [2020-06-22 06:54:39,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74acb0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,309 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:54:39,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:54:38" (2/5) ... [2020-06-22 06:54:39,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74acb0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,310 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:54:39,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:54:39" (3/5) ... [2020-06-22 06:54:39,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74acb0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,310 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:54:39,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:54:39" (4/5) ... [2020-06-22 06:54:39,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74acb0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:54:39, skipping insertion in model container [2020-06-22 06:54:39,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:54:39,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:54:39" (5/5) ... [2020-06-22 06:54:39,312 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:54:39,337 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:54:39,338 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 06:54:39,338 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 06:54:39,338 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:54:39,338 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:54:39,338 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:54:39,338 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 06:54:39,338 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:54:39,338 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 06:54:39,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 06:54:39,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 06:54:39,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:54:39,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:54:39,367 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:54:39,367 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 06:54:39,367 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 06:54:39,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 06:54:39,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 06:54:39,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:54:39,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:54:39,369 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:54:39,369 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 06:54:39,374 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [44] ULTIMATE.startENTRY-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~a~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_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_~a~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~b~0] 7#L16-2true [2020-06-22 06:54:39,374 INFO L796 eck$LassoCheckResult]: Loop: 7#L16-2true [57] L16-2-->L23-1: Formula: (< v_ULTIMATE.start_main_~a~0_9 30) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} AuxVars[] AssignedVars[] 5#L23-1true [65] L23-1-->L16-2: Formula: (and (<= v_ULTIMATE.start_main_~a~0_18 v_ULTIMATE.start_main_~b~0_17) (= v_ULTIMATE.start_main_~b~0_16 (+ v_ULTIMATE.start_main_~b~0_17 (- 10))) (= v_ULTIMATE.start_main_~a~0_17 (+ v_ULTIMATE.start_main_~a~0_18 2))) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_18, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_17} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_17, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 7#L16-2true [2020-06-22 06:54:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 1 times [2020-06-22 06:54:39,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:39,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2793, now seen corresponding path program 1 times [2020-06-22 06:54:39,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:39,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:39,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 73907, now seen corresponding path program 1 times [2020-06-22 06:54:39,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:39,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:39,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:39,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:39,527 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:54:39,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:54:39,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:54:39,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:54:39,529 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:54:39,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:39,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:54:39,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:54:39,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:54:39,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:54:39,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:54:39,549 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 06:54:39,559 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 06:54:39,564 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 06:54:39,661 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:54:39,662 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:39,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:39,669 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:39,702 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:54:39,702 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:39,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:39,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:39,735 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:54:39,736 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:39,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:39,741 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:39,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:54:39,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:39,808 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:54:39,810 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:54:39,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:54:39,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:54:39,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:54:39,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:54:39,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:54:39,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:54:39,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:54:39,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:54:39,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:54:39,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:54:39,813 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 06:54:39,817 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 06:54:39,821 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 06:54:39,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:54:39,925 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:54:39,927 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 06:54:39,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:39,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:39,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:39,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:39,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:54:39,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:54:39,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:54:39,943 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 06:54:39,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:39,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:39,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:39,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:39,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:54:39,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:54:39,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:54:39,956 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 06:54:39,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:39,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:54:39,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:39,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:39,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:39,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:54:39,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:54:39,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:54:39,983 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 06:54:39,983 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:54:39,985 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:54:39,986 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:54:39,986 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:54:39,986 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0) = -1*ULTIMATE.start_main_~a~0 + 30 Supporting invariants [] [2020-06-22 06:54:39,988 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:54:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:54:40,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:54:40,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:40,048 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 06:54:40,076 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 06:54:40,081 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 06:54:40,083 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 3 states. [2020-06-22 06:54:40,149 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 3 states. Result 21 states and 39 transitions. Complement of second has 6 states. [2020-06-22 06:54:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 06:54:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 06:54:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-06-22 06:54:40,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 06:54:40,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:40,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 06:54:40,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:40,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 06:54:40,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:40,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 39 transitions. [2020-06-22 06:54:40,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:54:40,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 15 states and 29 transitions. [2020-06-22 06:54:40,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 06:54:40,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 06:54:40,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 29 transitions. [2020-06-22 06:54:40,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:54:40,170 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 29 transitions. [2020-06-22 06:54:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 29 transitions. [2020-06-22 06:54:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 06:54:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 06:54:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2020-06-22 06:54:40,200 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 26 transitions. [2020-06-22 06:54:40,200 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 26 transitions. [2020-06-22 06:54:40,200 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 06:54:40,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 26 transitions. [2020-06-22 06:54:40,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:54:40,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:54:40,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:54:40,202 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 06:54:40,202 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:54:40,202 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY [44] ULTIMATE.startENTRY-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~a~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_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_~a~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~b~0] 67#L16-2 [57] L16-2-->L23-1: Formula: (< v_ULTIMATE.start_main_~a~0_9 30) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} AuxVars[] AssignedVars[] 71#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 74#L18 [60] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_12 (+ v_ULTIMATE.start_main_~b~0_13 2)) (>= 5 v_ULTIMATE.start_main_~b~0_13)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 73#L18-2 [63] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_14 (+ v_ULTIMATE.start_main_~a~0_15 1)) (> v_ULTIMATE.start_main_~b~0_15 12)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_15} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 72#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 68#L18 [2020-06-22 06:54:40,202 INFO L796 eck$LassoCheckResult]: Loop: 68#L18 [51] L18-->L18-2: Formula: (and (< 5 v_ULTIMATE.start_main_~b~0_11) (= v_ULTIMATE.start_main_~b~0_10 (+ v_ULTIMATE.start_main_~b~0_11 7))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 62#L18-2 [46] L18-2-->L23-1: Formula: (and (<= 10 v_ULTIMATE.start_main_~b~0_14) (<= v_ULTIMATE.start_main_~b~0_14 12) (= v_ULTIMATE.start_main_~a~0_12 (+ v_ULTIMATE.start_main_~a~0_13 10))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_14, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_14, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 63#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 68#L18 [2020-06-22 06:54:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2093591061, now seen corresponding path program 1 times [2020-06-22 06:54:40,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:40,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:54:40,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:54:40,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 06:54:40,252 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 06:54:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash 80278, now seen corresponding path program 1 times [2020-06-22 06:54:40,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:40,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:40,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,267 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 06:54:40,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:54:40,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 06:54:40,268 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:54:40,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 06:54:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 06:54:40,271 INFO L87 Difference]: Start difference. First operand 13 states and 26 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-06-22 06:54:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:54:40,300 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2020-06-22 06:54:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 06:54:40,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 37 transitions. [2020-06-22 06:54:40,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 06:54:40,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 37 transitions. [2020-06-22 06:54:40,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 06:54:40,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 06:54:40,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 37 transitions. [2020-06-22 06:54:40,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:54:40,306 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-06-22 06:54:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 37 transitions. [2020-06-22 06:54:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 06:54:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 06:54:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2020-06-22 06:54:40,309 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-06-22 06:54:40,309 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-06-22 06:54:40,309 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 06:54:40,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 37 transitions. [2020-06-22 06:54:40,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 06:54:40,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:54:40,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:54:40,311 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 06:54:40,311 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:54:40,311 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY [44] ULTIMATE.startENTRY-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~a~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_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_~a~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~b~0] 108#L16-2 [57] L16-2-->L23-1: Formula: (< v_ULTIMATE.start_main_~a~0_9 30) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} AuxVars[] AssignedVars[] 112#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 120#L18 [51] L18-->L18-2: Formula: (and (< 5 v_ULTIMATE.start_main_~b~0_11) (= v_ULTIMATE.start_main_~b~0_10 (+ v_ULTIMATE.start_main_~b~0_11 7))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 121#L18-2 [63] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_14 (+ v_ULTIMATE.start_main_~a~0_15 1)) (> v_ULTIMATE.start_main_~b~0_15 12)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_15} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 115#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 109#L18 [2020-06-22 06:54:40,311 INFO L796 eck$LassoCheckResult]: Loop: 109#L18 [51] L18-->L18-2: Formula: (and (< 5 v_ULTIMATE.start_main_~b~0_11) (= v_ULTIMATE.start_main_~b~0_10 (+ v_ULTIMATE.start_main_~b~0_11 7))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 103#L18-2 [63] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_14 (+ v_ULTIMATE.start_main_~a~0_15 1)) (> v_ULTIMATE.start_main_~b~0_15 12)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_15} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 104#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 109#L18 [2020-06-22 06:54:40,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2093599710, now seen corresponding path program 1 times [2020-06-22 06:54:40,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:40,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash 80805, now seen corresponding path program 1 times [2020-06-22 06:54:40,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1086162916, now seen corresponding path program 2 times [2020-06-22 06:54:40,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:40,370 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:54:40,370 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:54:40,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:54:40,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:54:40,371 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:54:40,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:40,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:54:40,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:54:40,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 06:54:40,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:54:40,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:54:40,373 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 06:54:40,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 06:54:40,378 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 06:54:40,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:54:40,449 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:40,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:40,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:40,485 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:54:40,486 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 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 06:54:40,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:40,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:40,519 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:54:40,520 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 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 06:54:40,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:40,526 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:40,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:54:40,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:40,826 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:54:40,829 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:54:40,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:54:40,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:54:40,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:54:40,829 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:54:40,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:54:40,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:54:40,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:54:40,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 06:54:40,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:54:40,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:54:40,832 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 06:54:40,835 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 06:54:40,838 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 06:54:40,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:54:40,901 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:54:40,902 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 06:54:40,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:40,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:40,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:40,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:40,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:54:40,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:54:40,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:54:40,910 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 06:54:40,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:40,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:40,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:40,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:40,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 06:54:40,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 06:54:40,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:54:40,918 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 06:54:40,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:40,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:54:40,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:40,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:40,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:40,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:54:40,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:54:40,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:54:40,935 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 06:54:40,935 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 06:54:40,936 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:54:40,936 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:54:40,936 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:54:40,936 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0, ULTIMATE.start_main_~a~0) = -1*ULTIMATE.start_main_~b~0 + 1*ULTIMATE.start_main_~a~0 Supporting invariants [] [2020-06-22 06:54:40,937 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:54:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:54:40,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,966 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:54:40,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:40,992 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 06:54:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:40,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:54:40,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:41,056 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 06:54:41,056 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 06:54:41,057 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 37 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-06-22 06:54:41,112 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 37 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 21 states and 37 transitions. Complement of second has 3 states. [2020-06-22 06:54:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 0 non-accepting loop states 2 accepting loop states [2020-06-22 06:54:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:54:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-06-22 06:54:41,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 06:54:41,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,114 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 06:54:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:54:41,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:41,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:54:41,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:41,157 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 06:54:41,158 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 06:54:41,158 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 37 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-06-22 06:54:41,214 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 37 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 34 states and 56 transitions. Complement of second has 8 states. [2020-06-22 06:54:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 06:54:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:54:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-06-22 06:54:41,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 06:54:41,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 06:54:41,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 06:54:41,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 56 transitions. [2020-06-22 06:54:41,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:54:41,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 40 transitions. [2020-06-22 06:54:41,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 06:54:41,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 06:54:41,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 40 transitions. [2020-06-22 06:54:41,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:54:41,222 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 40 transitions. [2020-06-22 06:54:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 40 transitions. [2020-06-22 06:54:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-06-22 06:54:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 06:54:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2020-06-22 06:54:41,224 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-06-22 06:54:41,224 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-06-22 06:54:41,224 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 06:54:41,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 34 transitions. [2020-06-22 06:54:41,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:54:41,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:54:41,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:54:41,226 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 06:54:41,226 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:54:41,226 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY [44] ULTIMATE.startENTRY-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~a~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_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_~a~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~b~0] 279#L16-2 [57] L16-2-->L23-1: Formula: (< v_ULTIMATE.start_main_~a~0_9 30) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} AuxVars[] AssignedVars[] 290#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 296#L18 [60] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_12 (+ v_ULTIMATE.start_main_~b~0_13 2)) (>= 5 v_ULTIMATE.start_main_~b~0_13)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 295#L18-2 [62] L18-2-->L23-1: Formula: (and (> 10 v_ULTIMATE.start_main_~b~0_15) (= v_ULTIMATE.start_main_~a~0_14 (+ v_ULTIMATE.start_main_~a~0_15 1))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_15} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 293#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 285#L18 [2020-06-22 06:54:41,227 INFO L796 eck$LassoCheckResult]: Loop: 285#L18 [60] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_12 (+ v_ULTIMATE.start_main_~b~0_13 2)) (>= 5 v_ULTIMATE.start_main_~b~0_13)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 280#L18-2 [46] L18-2-->L23-1: Formula: (and (<= 10 v_ULTIMATE.start_main_~b~0_14) (<= v_ULTIMATE.start_main_~b~0_14 12) (= v_ULTIMATE.start_main_~a~0_12 (+ v_ULTIMATE.start_main_~a~0_13 10))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_14, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_14, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 281#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 285#L18 [2020-06-22 06:54:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2093591092, now seen corresponding path program 1 times [2020-06-22 06:54:41,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:41,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:41,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:54:41,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash 88927, now seen corresponding path program 1 times [2020-06-22 06:54:41,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:41,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:41,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:41,252 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 06:54:41,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:54:41,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 06:54:41,253 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:54:41,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 06:54:41,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 06:54:41,254 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-06-22 06:54:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:54:41,273 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-06-22 06:54:41,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 06:54:41,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 33 transitions. [2020-06-22 06:54:41,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:54:41,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 33 transitions. [2020-06-22 06:54:41,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 06:54:41,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 06:54:41,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-06-22 06:54:41,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:54:41,278 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 06:54:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-06-22 06:54:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-06-22 06:54:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 06:54:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-06-22 06:54:41,280 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-06-22 06:54:41,280 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-06-22 06:54:41,281 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 06:54:41,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2020-06-22 06:54:41,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:54:41,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:54:41,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:54:41,282 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 06:54:41,282 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:54:41,282 INFO L794 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY [44] ULTIMATE.startENTRY-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~a~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_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_~a~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~b~0] 329#L16-2 [57] L16-2-->L23-1: Formula: (< v_ULTIMATE.start_main_~a~0_9 30) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9} AuxVars[] AssignedVars[] 334#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 339#L18 [60] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_12 (+ v_ULTIMATE.start_main_~b~0_13 2)) (>= 5 v_ULTIMATE.start_main_~b~0_13)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 338#L18-2 [62] L18-2-->L23-1: Formula: (and (> 10 v_ULTIMATE.start_main_~b~0_15) (= v_ULTIMATE.start_main_~a~0_14 (+ v_ULTIMATE.start_main_~a~0_15 1))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_15} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 336#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 330#L18 [2020-06-22 06:54:41,283 INFO L796 eck$LassoCheckResult]: Loop: 330#L18 [60] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_12 (+ v_ULTIMATE.start_main_~b~0_13 2)) (>= 5 v_ULTIMATE.start_main_~b~0_13)) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_13} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~b~0] 324#L18-2 [62] L18-2-->L23-1: Formula: (and (> 10 v_ULTIMATE.start_main_~b~0_15) (= v_ULTIMATE.start_main_~a~0_14 (+ v_ULTIMATE.start_main_~a~0_15 1))) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_15} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_15, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 325#L23-1 [50] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~b~0_9 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 330#L18 [2020-06-22 06:54:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2093591092, now seen corresponding path program 2 times [2020-06-22 06:54:41,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:41,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:41,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash 89423, now seen corresponding path program 1 times [2020-06-22 06:54:41,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:54:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1342910372, now seen corresponding path program 3 times [2020-06-22 06:54:41,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:54:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:54:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:54:41,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:54:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:54:41,334 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:54:41,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:54:41,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:54:41,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:54:41,334 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:54:41,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:41,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:54:41,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:54:41,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 06:54:41,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:54:41,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:54:41,336 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 06:54:41,346 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 06:54:41,350 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 06:54:41,404 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:54:41,404 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:41,407 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:54:41,407 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:54:41,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:54:41,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:54:41,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:54:41,496 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:54:41,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:54:41,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:54:41,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:54:41,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:54:41,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:54:41,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:54:41,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:54:41,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 06:54:41,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:54:41,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:54:41,499 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 06:54:41,508 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 06:54:41,510 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 06:54:41,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:54:41,552 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:54:41,553 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 06:54:41,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:54:41,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:54:41,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:54:41,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:54:41,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:54:41,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:54:41,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:54:41,559 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:54:41,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:54:41,563 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:54:41,563 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:54:41,564 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:54:41,564 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:54:41,564 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0) = -1*ULTIMATE.start_main_~b~0 + 6 Supporting invariants [] [2020-06-22 06:54:41,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:54:41,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:54:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:41,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:54:41,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:41,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:54:41,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:41,609 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 06:54:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:54:41,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:54:41,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:54:41,637 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 06:54:41,637 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 06:54:41,637 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 27 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 06:54:41,674 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 27 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 44 transitions. Complement of second has 10 states. [2020-06-22 06:54:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 06:54:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 06:54:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-06-22 06:54:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 06:54:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 06:54:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 06:54:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:54:41,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 44 transitions. [2020-06-22 06:54:41,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:54:41,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2020-06-22 06:54:41,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 06:54:41,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 06:54:41,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 06:54:41,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:54:41,679 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:54:41,679 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:54:41,679 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:54:41,679 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 06:54:41,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 06:54:41,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:54:41,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 06:54:41,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:54:41 BasicIcfg [2020-06-22 06:54:41,686 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 06:54:41,686 INFO L168 Benchmark]: Toolchain (without parser) took 3204.22 ms. Allocated memory was 649.6 MB in the beginning and 755.0 MB in the end (delta: 105.4 MB). Free memory was 565.6 MB in the beginning and 673.0 MB in the end (delta: -107.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:54:41,688 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 06:54:41,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.05 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 564.2 MB in the beginning and 658.5 MB in the end (delta: -94.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.91 ms. Allocated memory is still 691.0 MB. Free memory was 658.5 MB in the beginning and 657.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,690 INFO L168 Benchmark]: Boogie Preprocessor took 20.53 ms. Allocated memory is still 691.0 MB. Free memory was 657.2 MB in the beginning and 654.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,690 INFO L168 Benchmark]: RCFGBuilder took 216.08 ms. Allocated memory is still 691.0 MB. Free memory was 654.1 MB in the beginning and 638.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,691 INFO L168 Benchmark]: BlockEncodingV2 took 87.04 ms. Allocated memory is still 691.0 MB. Free memory was 638.7 MB in the beginning and 633.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,691 INFO L168 Benchmark]: TraceAbstraction took 164.49 ms. Allocated memory is still 691.0 MB. Free memory was 633.3 MB in the beginning and 623.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,692 INFO L168 Benchmark]: BuchiAutomizer took 2382.03 ms. Allocated memory was 691.0 MB in the beginning and 755.0 MB in the end (delta: 64.0 MB). Free memory was 623.9 MB in the beginning and 673.0 MB in the end (delta: -49.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 50.3 GB. [2020-06-22 06:54:41,696 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 15 edges - StatisticsResult: Encoded RCFG 5 locations, 9 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 293.05 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 564.2 MB in the beginning and 658.5 MB in the end (delta: -94.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.91 ms. Allocated memory is still 691.0 MB. Free memory was 658.5 MB in the beginning and 657.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.53 ms. Allocated memory is still 691.0 MB. Free memory was 657.2 MB in the beginning and 654.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 216.08 ms. Allocated memory is still 691.0 MB. Free memory was 654.1 MB in the beginning and 638.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 87.04 ms. Allocated memory is still 691.0 MB. Free memory was 638.7 MB in the beginning and 633.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 164.49 ms. Allocated memory is still 691.0 MB. Free memory was 633.3 MB in the beginning and 623.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2382.03 ms. Allocated memory was 691.0 MB in the beginning and 755.0 MB in the end (delta: 64.0 MB). Free memory was 623.9 MB in the beginning and 673.0 MB in the end (delta: -49.1 MB). Peak memory consumption was 14.9 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: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * a + 30 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * b + a and consists of 5 locations. One nondeterministic module has affine ranking function -1 * b + 6 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 56 SDslu, 6 SDs, 0 SdLazy, 124 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 06:54:35.237 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 06:54:41.928 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check