YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:52:25,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:52:25,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:52:25,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:52:25,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:52:25,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:52:25,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:52:25,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:52:25,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:52:25,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:52:25,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:52:25,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:52:25,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:52:25,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:52:25,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:52:25,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:52:25,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:52:25,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:52:25,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:52:25,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:52:25,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:52:25,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:52:25,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:52:25,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:52:25,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:52:25,410 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:52:25,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:52:25,411 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:52:25,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:52:25,412 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:52:25,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:52:25,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:52:25,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:52:25,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:52:25,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:52:25,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:52:25,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:52:25,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:52:25,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:52:25,418 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 04:52:25,433 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:52:25,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:52:25,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:52:25,434 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:52:25,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:52:25,434 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:52:25,435 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:52:25,435 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:52:25,435 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:52:25,435 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:52:25,435 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:52:25,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:52:25,436 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:52:25,436 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:52:25,436 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:25,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:52:25,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:52:25,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:52:25,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:52:25,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:52:25,437 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:52:25,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:52:25,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:52:25,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:52:25,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:52:25,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:52:25,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:52:25,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:52:25,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:52:25,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:52:25,477 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:52:25,480 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:52:25,482 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:52:25,482 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:52:25,483 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:52:25,551 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/eaa950b565cb4f0286b0fb3509310212/FLAGcd660df64 [2020-06-22 04:52:25,905 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:52:25,906 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:52:25,912 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/eaa950b565cb4f0286b0fb3509310212/FLAGcd660df64 [2020-06-22 04:52:26,318 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/eaa950b565cb4f0286b0fb3509310212 [2020-06-22 04:52:26,329 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:52:26,331 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:52:26,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:52:26,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:52:26,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:52:26,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2b5545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26, skipping insertion in model container [2020-06-22 04:52:26,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:52:26,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:52:26,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:52:26,522 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:52:26,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:52:26,606 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:52:26,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26 WrapperNode [2020-06-22 04:52:26,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:52:26,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:52:26,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:52:26,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:52:26,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:52:26,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:52:26,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:52:26,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:52:26,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:52:26,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:52:26,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:52:26,660 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:52:26,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:52:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:52:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:52:26,861 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:52:26,861 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 04:52:26,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:52:26 BoogieIcfgContainer [2020-06-22 04:52:26,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:52:26,863 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:52:26,863 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:52:26,865 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:52:26,866 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:52:26" (1/1) ... [2020-06-22 04:52:26,880 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges [2020-06-22 04:52:26,882 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:52:26,882 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:52:26,883 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:52:26,883 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:52:26,885 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:52:26,886 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:52:26,886 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:52:26,900 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:52:26,907 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 04:52:26,912 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 04:52:26,914 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:52:26,931 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 04:52:26,933 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 04:52:26,935 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:52:26,935 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:52:26,935 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:52:26,935 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:52:26,936 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-22 04:52:26,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:52:26 BasicIcfg [2020-06-22 04:52:26,936 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:52:26,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:52:26,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:52:26,941 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:52:26,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:52:26" (1/4) ... [2020-06-22 04:52:26,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270251be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:52:26, skipping insertion in model container [2020-06-22 04:52:26,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (2/4) ... [2020-06-22 04:52:26,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270251be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:52:26, skipping insertion in model container [2020-06-22 04:52:26,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:52:26" (3/4) ... [2020-06-22 04:52:26,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270251be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:52:26, skipping insertion in model container [2020-06-22 04:52:26,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:52:26" (4/4) ... [2020-06-22 04:52:26,945 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:52:26,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:52:26,962 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:52:26,978 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:52:27,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:52:27,008 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:52:27,008 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:52:27,008 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:52:27,008 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:52:27,009 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:52:27,009 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:52:27,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:52:27,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:52:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 04:52:27,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:52:27,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 04:52:27,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:52:27,080 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 18) no Hoare annotation was computed. [2020-06-22 04:52:27,080 INFO L451 ceAbstractionStarter]: At program point L12-2(lines 11 19) the Hoare annotation is: true [2020-06-22 04:52:27,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:52:27 BasicIcfg [2020-06-22 04:52:27,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:52:27,089 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:52:27,090 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:52:27,093 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:52:27,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:52:27,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:52:26" (1/5) ... [2020-06-22 04:52:27,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60dc2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:52:27, skipping insertion in model container [2020-06-22 04:52:27,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:52:27,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:52:26" (2/5) ... [2020-06-22 04:52:27,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60dc2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:52:27, skipping insertion in model container [2020-06-22 04:52:27,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:52:27,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:52:26" (3/5) ... [2020-06-22 04:52:27,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60dc2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:52:27, skipping insertion in model container [2020-06-22 04:52:27,096 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:52:27,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:52:26" (4/5) ... [2020-06-22 04:52:27,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60dc2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:52:27, skipping insertion in model container [2020-06-22 04:52:27,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:52:27,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:52:27" (5/5) ... [2020-06-22 04:52:27,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:52:27,124 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:52:27,124 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:52:27,124 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:52:27,125 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:52:27,125 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:52:27,125 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:52:27,125 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:52:27,125 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:52:27,125 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:52:27,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 04:52:27,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:52:27,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:27,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:27,151 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:52:27,151 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:52:27,151 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:52:27,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 04:52:27,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:52:27,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:27,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:27,152 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:52:27,152 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:52:27,157 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true [2020-06-22 04:52:27,158 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 5#L12true [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3#L12-2true [2020-06-22 04:52:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times [2020-06-22 04:52:27,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:27,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:27,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1801, now seen corresponding path program 1 times [2020-06-22 04:52:27,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:27,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:27,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:27,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:27,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 57539, now seen corresponding path program 1 times [2020-06-22 04:52:27,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:27,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:27,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:27,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:27,314 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:27,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:27,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:27,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:27,316 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:27,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:27,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:27,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:52:27,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:27,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:27,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:27,480 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:27,488 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:27,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:27,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:27,540 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:27,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:27,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:27,597 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:27,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:27,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:27,630 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:27,638 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:27,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:27,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:27,700 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:27,703 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:27,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:27,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:27,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:27,703 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:27,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:27,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:27,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:27,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:52:27,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:27,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:27,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:27,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:27,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:27,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:27,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:27,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:27,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:27,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:27,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:27,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:27,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:27,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:27,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:27,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:27,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:27,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:27,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:27,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:27,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:52:27,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:27,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:27,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:27,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:27,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:27,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:27,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:27,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:52:27,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:27,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:27,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:27,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:27,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:27,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:27,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:27,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:27,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:27,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:27,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:27,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:52:27,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:27,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:27,877 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:27,877 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2020-06-22 04:52:27,879 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:27,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:27,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:27,932 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:52:27,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:27,947 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 04:52:27,952 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 04:52:27,953 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-06-22 04:52:27,977 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. [2020-06-22 04:52:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:52:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:52:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 04:52:27,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 04:52:27,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:27,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 04:52:27,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:27,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 04:52:27,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:27,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. [2020-06-22 04:52:27,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:52:27,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 04:52:27,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:52:27,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 04:52:27,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-06-22 04:52:27,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:27,996 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 04:52:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-06-22 04:52:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 04:52:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:52:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 04:52:28,025 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 04:52:28,025 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 04:52:28,025 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:52:28,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-06-22 04:52:28,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:52:28,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:28,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:28,026 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:52:28,026 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:52:28,027 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 47#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 45#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 41#L12-2 [2020-06-22 04:52:28,027 INFO L796 eck$LassoCheckResult]: Loop: 41#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 42#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 41#L12-2 [2020-06-22 04:52:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash 57534, now seen corresponding path program 1 times [2020-06-22 04:52:28,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1801, now seen corresponding path program 2 times [2020-06-22 04:52:28,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:28,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash 55291014, now seen corresponding path program 1 times [2020-06-22 04:52:28,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:28,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:52:28,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:52:28,118 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:28,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:28,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:28,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:28,118 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:28,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:28,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:28,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:52:28,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:28,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:28,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,217 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:28,218 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:28,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:28,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:28,256 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 04:52:28,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:28,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:28,290 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/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:28,296 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:28,329 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:28,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:28,340 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 04:52:28,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,370 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:28,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:28,433 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:28,436 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:28,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:28,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:28,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:28,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:28,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:28,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:28,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:28,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:52:28,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:28,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:28,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:28,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:28,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:28,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:28,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:28,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:28,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:28,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:28,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:52:28,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:28,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:28,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:28,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:28,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:28,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:28,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:28,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:28,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:28,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:28,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:28,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:28,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:28,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:28,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:28,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:28,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:28,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:28,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:28,562 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:28,562 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:52:28,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:28,562 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:28,563 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:28,563 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2020-06-22 04:52:28,563 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:28,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:28,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:28,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:52:28,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:28,602 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 04:52:28,602 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 04:52:28,602 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-06-22 04:52:28,614 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. [2020-06-22 04:52:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:52:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:52:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 04:52:28,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 04:52:28,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:28,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 04:52:28,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:28,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 04:52:28,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:28,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2020-06-22 04:52:28,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:52:28,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2020-06-22 04:52:28,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:52:28,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 04:52:28,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-06-22 04:52:28,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:28,623 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-06-22 04:52:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-06-22 04:52:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. [2020-06-22 04:52:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 04:52:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-06-22 04:52:28,624 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-22 04:52:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:52:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:52:28,628 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. [2020-06-22 04:52:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:52:28,650 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-06-22 04:52:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:52:28,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-06-22 04:52:28,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:52:28,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 9 transitions. [2020-06-22 04:52:28,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:52:28,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 04:52:28,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-06-22 04:52:28,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:28,654 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-22 04:52:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-06-22 04:52:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-06-22 04:52:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 04:52:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-06-22 04:52:28,655 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-06-22 04:52:28,655 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-06-22 04:52:28,655 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:52:28,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-06-22 04:52:28,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:52:28,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:28,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:28,656 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-22 04:52:28,656 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:52:28,657 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 107#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 108#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 109#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 110#L12 [2020-06-22 04:52:28,657 INFO L796 eck$LassoCheckResult]: Loop: 110#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 112#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 110#L12 [2020-06-22 04:52:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 2 times [2020-06-22 04:52:28,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1886, now seen corresponding path program 1 times [2020-06-22 04:52:28,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:28,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1714170260, now seen corresponding path program 2 times [2020-06-22 04:52:28,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:28,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:28,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:28,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:28,703 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:28,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:28,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:28,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:28,704 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:28,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:28,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:28,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:52:28,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:28,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:28,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,783 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:28,784 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 04:52:28,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:28,789 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:28,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:28,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:28,852 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:28,854 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:28,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:28,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:28,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:28,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:28,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:28,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:28,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:28,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:52:28,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:28,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:28,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:28,936 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:28,936 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:28,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:28,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:28,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:28,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:28,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:28,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:28,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:28,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:28,943 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:28,946 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:28,946 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:52:28,946 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:28,946 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:28,946 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:28,946 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:52:28,947 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:28,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:28,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:28,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:52:28,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:29,023 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:52:29,024 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 04:52:29,024 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-06-22 04:52:29,032 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 10 states and 12 transitions. Complement of second has 4 states. [2020-06-22 04:52:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:52:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:52:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-06-22 04:52:29,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 04:52:29,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:29,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 04:52:29,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:29,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 04:52:29,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:29,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2020-06-22 04:52:29,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:52:29,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2020-06-22 04:52:29,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-06-22 04:52:29,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-06-22 04:52:29,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-06-22 04:52:29,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:29,038 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-06-22 04:52:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-06-22 04:52:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-06-22 04:52:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:52:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-06-22 04:52:29,039 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-22 04:52:29,039 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-06-22 04:52:29,039 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:52:29,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-06-22 04:52:29,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:52:29,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:29,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:29,040 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-22 04:52:29,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-06-22 04:52:29,041 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 163#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 164#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 169#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 168#L12 [2020-06-22 04:52:29,041 INFO L796 eck$LassoCheckResult]: Loop: 168#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 165#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 164#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 169#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 168#L12 [2020-06-22 04:52:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 3 times [2020-06-22 04:52:29,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:29,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1813526, now seen corresponding path program 1 times [2020-06-22 04:52:29,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1949820724, now seen corresponding path program 3 times [2020-06-22 04:52:29,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:29,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:29,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,118 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:29,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:29,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:29,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:29,119 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:29,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:29,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:29,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:52:29,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:29,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:29,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:29,219 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:29,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:29,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:29,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:29,257 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:29,290 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:29,295 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:29,319 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:29,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:29,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:29,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:29,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:29,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:29,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:29,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:29,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:52:29,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:29,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:29,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:29,378 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:29,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:29,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:29,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:29,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:29,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:29,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:29,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:29,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:29,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:29,387 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:29,387 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:52:29,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:29,388 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:29,388 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:29,388 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 221 Supporting invariants [] [2020-06-22 04:52:29,389 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:29,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:29,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:29,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:52:29,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:29,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:52:29,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:29,468 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:52:29,468 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 04:52:29,468 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-06-22 04:52:29,492 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 8 states. [2020-06-22 04:52:29,492 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 04:52:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:52:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-06-22 04:52:29,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 04:52:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:29,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 04:52:29,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:29,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 04:52:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:29,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2020-06-22 04:52:29,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 04:52:29,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. [2020-06-22 04:52:29,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:52:29,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 04:52:29,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-06-22 04:52:29,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:29,500 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-22 04:52:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-06-22 04:52:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-06-22 04:52:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 04:52:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 04:52:29,502 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 04:52:29,502 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 04:52:29,502 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:52:29,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-06-22 04:52:29,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 04:52:29,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:29,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:29,503 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-06-22 04:52:29,503 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2020-06-22 04:52:29,504 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 251#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 252#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 258#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L12 [2020-06-22 04:52:29,504 INFO L796 eck$LassoCheckResult]: Loop: 256#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 253#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 254#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 264#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 263#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 262#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 261#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 260#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 252#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 258#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L12 [2020-06-22 04:52:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1783735, now seen corresponding path program 4 times [2020-06-22 04:52:29,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:29,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:29,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:29,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1368636088, now seen corresponding path program 2 times [2020-06-22 04:52:29,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:29,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:29,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:29,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2050633346, now seen corresponding path program 4 times [2020-06-22 04:52:29,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 04:52:29,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:52:29,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:52:29,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 04:52:29,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 04:52:29,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:52:29,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:52:29,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 04:52:29,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:52:29,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 04:52:29,733 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:29,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:29,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:29,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:29,733 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:29,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:29,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:29,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:52:29,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:29,734 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:29,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,802 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:29,803 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:29,807 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:29,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:29,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:29,933 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:29,935 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:29,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:29,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:29,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:29,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:29,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:29,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:29,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:29,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:52:29,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:29,936 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:29,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:29,997 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:29,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:29,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:29,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:29,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:29,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:29,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:29,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:30,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:30,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:30,003 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:30,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:30,005 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:52:30,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:30,006 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:30,006 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:30,006 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:52:30,006 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,313 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 04:52:30,314 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 13 loop predicates [2020-06-22 04:52:30,314 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-06-22 04:52:30,397 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 129 states and 152 transitions. Complement of second has 34 states. [2020-06-22 04:52:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 04:52:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:52:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-06-22 04:52:30,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. [2020-06-22 04:52:30,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:30,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 14 letters. Loop has 10 letters. [2020-06-22 04:52:30,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:30,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 4 letters. Loop has 20 letters. [2020-06-22 04:52:30,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:30,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 152 transitions. [2020-06-22 04:52:30,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-06-22 04:52:30,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 64 states and 85 transitions. [2020-06-22 04:52:30,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 04:52:30,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 04:52:30,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 85 transitions. [2020-06-22 04:52:30,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:30,410 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 85 transitions. [2020-06-22 04:52:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 85 transitions. [2020-06-22 04:52:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2020-06-22 04:52:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 04:52:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2020-06-22 04:52:30,415 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2020-06-22 04:52:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 04:52:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 04:52:30,415 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand 5 states. [2020-06-22 04:52:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:52:30,431 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2020-06-22 04:52:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 04:52:30,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 93 transitions. [2020-06-22 04:52:30,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 04:52:30,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 49 states and 66 transitions. [2020-06-22 04:52:30,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 04:52:30,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 04:52:30,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 66 transitions. [2020-06-22 04:52:30,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:30,436 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2020-06-22 04:52:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 66 transitions. [2020-06-22 04:52:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-06-22 04:52:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 04:52:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2020-06-22 04:52:30,441 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2020-06-22 04:52:30,441 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2020-06-22 04:52:30,441 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:52:30,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2020-06-22 04:52:30,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 04:52:30,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:30,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:30,443 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-06-22 04:52:30,443 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2020-06-22 04:52:30,443 INFO L794 eck$LassoCheckResult]: Stem: 778#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 779#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 793#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 794#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 782#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 773#L12-2 [2020-06-22 04:52:30,443 INFO L796 eck$LassoCheckResult]: Loop: 773#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 775#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 798#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 797#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 795#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 786#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 783#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 782#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 773#L12-2 [2020-06-22 04:52:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash 55295819, now seen corresponding path program 5 times [2020-06-22 04:52:30,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:30,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1295692375, now seen corresponding path program 3 times [2020-06-22 04:52:30,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:30,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:30,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:30,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:52:30,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:52:30,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:52:30,474 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:52:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:52:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:52:30,475 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-06-22 04:52:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:52:30,489 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2020-06-22 04:52:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:52:30,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2020-06-22 04:52:30,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-06-22 04:52:30,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 55 transitions. [2020-06-22 04:52:30,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:52:30,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 04:52:30,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2020-06-22 04:52:30,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:30,496 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-06-22 04:52:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2020-06-22 04:52:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-06-22 04:52:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 04:52:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2020-06-22 04:52:30,500 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-06-22 04:52:30,500 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2020-06-22 04:52:30,500 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 04:52:30,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2020-06-22 04:52:30,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-06-22 04:52:30,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:30,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:30,502 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-06-22 04:52:30,502 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [12, 7, 5] [2020-06-22 04:52:30,503 INFO L794 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 883#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 906#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 892#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 887#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 877#L12-2 [2020-06-22 04:52:30,503 INFO L796 eck$LassoCheckResult]: Loop: 877#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 879#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 912#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 911#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 909#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 908#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 907#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 905#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 904#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 901#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 903#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 902#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 900#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 899#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 898#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 897#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 896#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 895#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 894#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 893#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 891#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 889#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 890#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 886#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 877#L12-2 [2020-06-22 04:52:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash 55295819, now seen corresponding path program 6 times [2020-06-22 04:52:30,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:30,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:30,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:30,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1147706558, now seen corresponding path program 4 times [2020-06-22 04:52:30,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:30,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash 371039752, now seen corresponding path program 5 times [2020-06-22 04:52:30,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:30,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-06-22 04:52:30,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:52:30,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:52:30,605 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 04:52:30,626 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2020-06-22 04:52:30,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:52:30,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 04:52:30,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:52:30,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:52:30,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 17 [2020-06-22 04:52:31,076 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-06-22 04:52:31,090 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:31,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:31,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:31,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:31,091 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:31,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:31,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:31,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:31,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 04:52:31,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:31,091 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:31,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,157 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:31,157 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:31,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:31,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:31,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:31,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:31,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:31,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:31,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:52:31,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:31,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:31,233 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:31,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:31,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:31,335 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:31,337 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:31,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:31,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:31,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:31,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:31,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:31,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:31,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:31,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 04:52:31,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:31,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:31,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:31,394 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:31,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:31,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:31,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:31,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:31,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:31,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:31,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:31,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:52:31,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:31,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:31,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:31,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:31,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:31,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:31,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:31,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:52:31,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:31,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:31,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:31,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:31,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:31,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:31,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:31,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:31,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:31,421 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:31,422 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:31,423 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:52:31,423 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:31,423 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:31,423 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:31,423 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-06-22 04:52:31,424 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 72 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-06-22 04:52:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:31,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:52:31,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:32,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 04:52:32,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:32,306 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 23 predicates after loop cannibalization [2020-06-22 04:52:32,306 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 23 loop predicates [2020-06-22 04:52:32,307 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-06-22 04:52:33,285 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states and 50 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 861 states and 948 transitions. Complement of second has 218 states. [2020-06-22 04:52:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 1 stem states 20 non-accepting loop states 3 accepting loop states [2020-06-22 04:52:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:52:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2020-06-22 04:52:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 5 letters. Loop has 24 letters. [2020-06-22 04:52:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 29 letters. Loop has 24 letters. [2020-06-22 04:52:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 46 transitions. Stem has 5 letters. Loop has 48 letters. [2020-06-22 04:52:33,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:33,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 948 transitions. [2020-06-22 04:52:33,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 04:52:33,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 66 states and 74 transitions. [2020-06-22 04:52:33,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 04:52:33,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-06-22 04:52:33,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2020-06-22 04:52:33,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:33,309 INFO L706 BuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2020-06-22 04:52:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2020-06-22 04:52:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 30. [2020-06-22 04:52:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 04:52:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-06-22 04:52:33,312 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-06-22 04:52:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 04:52:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2020-06-22 04:52:33,313 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 17 states. [2020-06-22 04:52:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:52:33,500 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2020-06-22 04:52:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-06-22 04:52:33,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 114 transitions. [2020-06-22 04:52:33,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-06-22 04:52:33,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 48 states and 55 transitions. [2020-06-22 04:52:33,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 04:52:33,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 04:52:33,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 55 transitions. [2020-06-22 04:52:33,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:33,504 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 55 transitions. [2020-06-22 04:52:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 55 transitions. [2020-06-22 04:52:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2020-06-22 04:52:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 04:52:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-06-22 04:52:33,507 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-06-22 04:52:33,508 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-06-22 04:52:33,508 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 04:52:33,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2020-06-22 04:52:33,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 04:52:33,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:33,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:33,509 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 1] [2020-06-22 04:52:33,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2020-06-22 04:52:33,509 INFO L794 eck$LassoCheckResult]: Stem: 3956#ULTIMATE.startENTRY [28] ULTIMATE.startENTRY-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~c~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3957#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3971#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3970#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3969#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3968#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3963#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3965#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3978#L12 [2020-06-22 04:52:33,510 INFO L796 eck$LassoCheckResult]: Loop: 3978#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3977#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3976#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3975#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3974#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3952#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3953#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3983#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3980#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3981#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3982#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3954#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3955#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3960#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3979#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3959#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3973#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3972#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3966#L12 [29] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3967#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3961#L12 [34] L12-->L12-2: Formula: (and (>= 100 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~x~0] 3962#L12-2 [26] L12-2-->L12: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3978#L12 [2020-06-22 04:52:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1949671769, now seen corresponding path program 7 times [2020-06-22 04:52:33,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:33,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:33,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:33,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash 19520071, now seen corresponding path program 5 times [2020-06-22 04:52:33,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:33,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:33,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1948051347, now seen corresponding path program 6 times [2020-06-22 04:52:33,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:33,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:33,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:52:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:33,748 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2020-06-22 04:52:33,758 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:33,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:33,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:33,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:33,759 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:52:33,759 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:33,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:33,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:33,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 04:52:33,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:33,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:33,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:33,812 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:33,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:52:33,817 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:52:33,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:52:33,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:33,918 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:33,919 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:33,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:33,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:33,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:33,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:33,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:33,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:33,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:33,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-22 04:52:33,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:33,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:33,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:52:33,971 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:33,972 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:33,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:52:33,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:33,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:33,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:33,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:33,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:33,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:33,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:33,976 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:52:33,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:52:33,978 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:52:33,978 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:52:33,978 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:52:33,978 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:52:33,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-06-22 04:52:33,979 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:52:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:33,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:52:33,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 53 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-06-22 04:52:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:34,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:52:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:52:34,856 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 04:52:34,857 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 8 loop predicates [2020-06-22 04:52:34,857 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 36 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-06-22 04:52:34,980 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 36 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 116 states and 136 transitions. Complement of second has 24 states. [2020-06-22 04:52:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 04:52:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:52:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-06-22 04:52:34,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 22 letters. [2020-06-22 04:52:34,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:34,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 30 letters. Loop has 22 letters. [2020-06-22 04:52:34,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:34,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 44 letters. [2020-06-22 04:52:34,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:52:34,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 136 transitions. [2020-06-22 04:52:34,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:52:34,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 0 states and 0 transitions. [2020-06-22 04:52:34,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:52:34,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:52:34,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:52:34,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:52:34,999 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:52:34,999 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:52:34,999 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:52:34,999 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 04:52:34,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:52:34,999 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:52:34,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:52:35,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:52:35 BasicIcfg [2020-06-22 04:52:35,006 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:52:35,007 INFO L168 Benchmark]: Toolchain (without parser) took 8676.99 ms. Allocated memory was 649.6 MB in the beginning and 855.1 MB in the end (delta: 205.5 MB). Free memory was 558.8 MB in the beginning and 817.0 MB in the end (delta: -258.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:52:35,008 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:52:35,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.74 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 558.8 MB in the beginning and 642.5 MB in the end (delta: -83.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:35,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.47 ms. Allocated memory is still 675.8 MB. Free memory was 641.1 MB in the beginning and 638.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:35,009 INFO L168 Benchmark]: Boogie Preprocessor took 18.41 ms. Allocated memory is still 675.8 MB. Free memory was 638.0 MB in the beginning and 636.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:35,010 INFO L168 Benchmark]: RCFGBuilder took 203.25 ms. Allocated memory is still 675.8 MB. Free memory was 636.7 MB in the beginning and 625.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:35,010 INFO L168 Benchmark]: BlockEncodingV2 took 73.27 ms. Allocated memory is still 675.8 MB. Free memory was 623.7 MB in the beginning and 619.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:35,011 INFO L168 Benchmark]: TraceAbstraction took 151.62 ms. Allocated memory is still 675.8 MB. Free memory was 619.7 MB in the beginning and 610.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:35,011 INFO L168 Benchmark]: BuchiAutomizer took 7916.79 ms. Allocated memory was 675.8 MB in the beginning and 855.1 MB in the end (delta: 179.3 MB). Free memory was 610.2 MB in the beginning and 817.0 MB in the end (delta: -206.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:52:35,015 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 7 locations, 9 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 274.74 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 558.8 MB in the beginning and 642.5 MB in the end (delta: -83.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.47 ms. Allocated memory is still 675.8 MB. Free memory was 641.1 MB in the beginning and 638.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.41 ms. Allocated memory is still 675.8 MB. Free memory was 638.0 MB in the beginning and 636.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 203.25 ms. Allocated memory is still 675.8 MB. Free memory was 636.7 MB in the beginning and 625.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 73.27 ms. Allocated memory is still 675.8 MB. Free memory was 623.7 MB in the beginning and 619.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 151.62 ms. Allocated memory is still 675.8 MB. Free memory was 619.7 MB in the beginning and 610.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 7916.79 ms. Allocated memory was 675.8 MB in the beginning and 855.1 MB in the end (delta: 179.3 MB). Free memory was 610.2 MB in the beginning and 817.0 MB in the end (delta: -206.8 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 221 and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function c and consists of 25 locations. One nondeterministic module has affine ranking function c and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 9 iterations. TraceHistogramMax:12. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 93 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 206/264 HoareTripleCheckerStatistics: 37 SDtfs, 75 SDslu, 33 SDs, 0 SdLazy, 291 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp97 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:52:23.048 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 04:52:35.251 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check