YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:18:08,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:18:08,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:18:08,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:18:08,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:18:08,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:18:08,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:18:08,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:18:08,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:18:08,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:18:08,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:18:08,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:18:08,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:18:08,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:18:08,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:18:08,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:18:08,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:18:08,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:18:08,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:18:08,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:18:08,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:18:08,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:18:08,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:18:08,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:18:08,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:18:08,600 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:18:08,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:18:08,601 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:18:08,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:18:08,602 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:18:08,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:18:08,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:18:08,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:18:08,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:18:08,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:18:08,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:18:08,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:18:08,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:18:08,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:18:08,607 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:18:08,622 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:18:08,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:18:08,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:18:08,623 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:18:08,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:18:08,623 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:18:08,624 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:18:08,624 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:18:08,624 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:18:08,624 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:18:08,624 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:18:08,624 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:18:08,624 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:18:08,625 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:18:08,625 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:08,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:18:08,625 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:18:08,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:18:08,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:18:08,626 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:18:08,626 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:18:08,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:18:08,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:18:08,626 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:18:08,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:18:08,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:18:08,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:18:08,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:18:08,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:18:08,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:18:08,665 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:18:08,669 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:18:08,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:18:08,671 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:18:08,671 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:18:08,738 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/837ab70412cb46a58d31213fe400fbac/FLAG12c1aab9d [2020-06-22 10:18:09,085 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:18:09,085 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:18:09,092 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/837ab70412cb46a58d31213fe400fbac/FLAG12c1aab9d [2020-06-22 10:18:09,486 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/837ab70412cb46a58d31213fe400fbac [2020-06-22 10:18:09,497 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:18:09,499 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:18:09,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:18:09,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:18:09,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:18:09,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@936fbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09, skipping insertion in model container [2020-06-22 10:18:09,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:18:09,532 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:18:09,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:18:09,692 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:18:09,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:18:09,777 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:18:09,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09 WrapperNode [2020-06-22 10:18:09,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:18:09,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:18:09,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:18:09,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:18:09,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:18:09,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:18:09,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:18:09,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:18:09,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... [2020-06-22 10:18:09,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:18:09,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:18:09,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:18:09,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:18:09,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:18:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:18:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:18:10,042 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:18:10,043 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 10:18:10,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:18:10 BoogieIcfgContainer [2020-06-22 10:18:10,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:18:10,045 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:18:10,045 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:18:10,047 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:18:10,048 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:18:10" (1/1) ... [2020-06-22 10:18:10,062 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges [2020-06-22 10:18:10,064 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:18:10,065 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:18:10,065 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:18:10,066 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:18:10,068 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:18:10,068 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:18:10,069 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:18:10,083 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:18:10,098 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 10:18:10,103 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:18:10,105 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:18:10,117 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 10:18:10,119 INFO L70 RemoveSinkStates]: Removed 6 edges and 2 locations by removing sink states [2020-06-22 10:18:10,121 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:18:10,121 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:18:10,127 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 10:18:10,127 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:18:10,127 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:18:10,127 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:18:10,128 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:18:10,128 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:18:10,128 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-22 10:18:10,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:18:10 BasicIcfg [2020-06-22 10:18:10,129 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:18:10,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:18:10,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:18:10,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:18:10,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:18:09" (1/4) ... [2020-06-22 10:18:10,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb8d1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (2/4) ... [2020-06-22 10:18:10,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb8d1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:18:10" (3/4) ... [2020-06-22 10:18:10,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb8d1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:18:10" (4/4) ... [2020-06-22 10:18:10,138 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:18:10,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:18:10,156 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 10:18:10,173 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 10:18:10,202 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:18:10,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:18:10,203 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:18:10,204 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:18:10,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:18:10,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:18:10,204 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:18:10,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:18:10,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:18:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 10:18:10,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:18:10,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 10:18:10,279 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:18:10,279 INFO L451 ceAbstractionStarter]: At program point L24-2(lines 24 27) the Hoare annotation is: true [2020-06-22 10:18:10,279 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 22 29) the Hoare annotation is: true [2020-06-22 10:18:10,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:18:10 BasicIcfg [2020-06-22 10:18:10,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:18:10,288 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:18:10,288 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:18:10,291 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:18:10,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:10,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:18:09" (1/5) ... [2020-06-22 10:18:10,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7214da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,293 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:10,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:18:09" (2/5) ... [2020-06-22 10:18:10,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7214da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,294 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:10,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:18:10" (3/5) ... [2020-06-22 10:18:10,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7214da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,294 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:10,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:18:10" (4/5) ... [2020-06-22 10:18:10,295 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a7214da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:10, skipping insertion in model container [2020-06-22 10:18:10,295 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:18:10,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:18:10" (5/5) ... [2020-06-22 10:18:10,297 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:18:10,324 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:18:10,324 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:18:10,324 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:18:10,325 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:18:10,325 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:18:10,325 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:18:10,325 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:18:10,325 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:18:10,325 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:18:10,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 10:18:10,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:18:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:10,352 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:18:10,353 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:18:10,353 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:18:10,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 10:18:10,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:18:10,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:10,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:10,354 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 10:18:10,354 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:18:10,359 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [60] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_16 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_14 10000)) (<= v_ULTIMATE.start_main_~z~0_12 10000) (<= v_ULTIMATE.start_main_~x~0_14 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_16, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 5#L22-2true [2020-06-22 10:18:10,360 INFO L796 eck$LassoCheckResult]: Loop: 5#L22-2true [48] L22-2-->L24-2: Formula: (and (<= 1 v_ULTIMATE.start_main_~y~0_8) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 4#L24-2true [58] L24-2-->L22-2: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_15 v_ULTIMATE.start_main_~x~0_13) v_ULTIMATE.start_main_~y~0_14) (<= v_ULTIMATE.start_main_~z~0_11 v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 5#L22-2true [2020-06-22 10:18:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 91, now seen corresponding path program 1 times [2020-06-22 10:18:10,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:10,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2507, now seen corresponding path program 1 times [2020-06-22 10:18:10,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:10,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:10,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:10,454 INFO L82 PathProgramCache]: Analyzing trace with hash 88997, now seen corresponding path program 1 times [2020-06-22 10:18:10,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:10,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:10,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:10,510 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:10,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:10,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:10,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:10,512 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:18:10,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:10,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:10,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:10,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 10:18:10,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:10,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:10,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:10,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:10,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:10,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:10,651 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:10,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:18:10,658 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 10:18:10,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:18:10,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:18:12,925 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:18:12,928 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:12,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:12,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:12,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:12,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:12,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:12,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:12,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:12,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 10:18:12,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:12,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:12,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:12,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:12,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:13,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:13,051 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:13,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:13,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:13,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:13,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:13,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:13,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:13,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:13,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:13,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:13,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:13,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:13,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:13,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:13,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:13,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:13,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:13,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:13,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:13,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:13,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:13,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:13,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:13,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:13,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:13,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:13,095 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 10:18:13,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:13,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:13,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:13,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:13,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:13,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:13,099 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:13,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:13,114 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:18:13,143 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 10:18:13,143 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:18:13,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:18:13,146 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:18:13,146 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:18:13,146 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 10:18:13,148 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:18:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:13,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:18:13,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:13,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:18:13,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:18:13,539 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization [2020-06-22 10:18:13,544 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 12 loop predicates [2020-06-22 10:18:13,545 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-06-22 10:18:14,105 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 19 states and 30 transitions. Complement of second has 18 states. [2020-06-22 10:18:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 10:18:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:18:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-06-22 10:18:14,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 10:18:14,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:14,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:18:14,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:14,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 10:18:14,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:14,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 30 transitions. [2020-06-22 10:18:14,121 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-06-22 10:18:14,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 12 states and 18 transitions. [2020-06-22 10:18:14,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 10:18:14,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 10:18:14,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2020-06-22 10:18:14,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:18:14,127 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 10:18:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2020-06-22 10:18:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2020-06-22 10:18:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:18:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 10:18:14,156 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 10:18:14,156 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 10:18:14,157 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:18:14,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-06-22 10:18:14,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:18:14,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:14,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:14,158 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:18:14,158 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 10:18:14,159 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [60] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_16 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_14 10000)) (<= v_ULTIMATE.start_main_~z~0_12 10000) (<= v_ULTIMATE.start_main_~x~0_14 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_16, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 98#L22-2 [48] L22-2-->L24-2: Formula: (and (<= 1 v_ULTIMATE.start_main_~y~0_8) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 99#L24-2 [44] L24-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1)) (< v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 100#L24-2 [2020-06-22 10:18:14,159 INFO L796 eck$LassoCheckResult]: Loop: 100#L24-2 [44] L24-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1)) (< v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 100#L24-2 [2020-06-22 10:18:14,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,159 INFO L82 PathProgramCache]: Analyzing trace with hash 88983, now seen corresponding path program 1 times [2020-06-22 10:18:14,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:14,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 1 times [2020-06-22 10:18:14,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2758517, now seen corresponding path program 2 times [2020-06-22 10:18:14,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:14,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:14,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,204 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:14,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:14,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:14,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:14,205 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:18:14,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:14,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:14,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 10:18:14,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:14,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:14,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,258 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:14,258 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:18:14,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:18:14,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:18:14,292 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:18:14,298 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:18:14,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:18:14,561 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:18:14,564 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:14,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:14,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:14,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:14,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:14,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:14,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:14,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:14,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 10:18:14,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:14,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:14,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,633 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:14,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:14,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:14,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:14,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:14,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:14,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:14,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:14,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:14,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:14,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:14,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:14,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:14,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:14,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:14,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:14,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:14,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:14,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:18:14,652 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:18:14,652 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:18:14,653 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:18:14,653 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:18:14,653 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:18:14,653 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~z~0 - 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 10:18:14,654 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:18:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:14,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:18:14,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:14,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:18:14,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:18:14,678 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 10:18:14,678 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 10:18:14,679 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-06-22 10:18:14,687 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 10 states and 15 transitions. Complement of second has 2 states. [2020-06-22 10:18:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-06-22 10:18:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 10:18:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2020-06-22 10:18:14,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2020-06-22 10:18:14,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:14,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2020-06-22 10:18:14,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:14,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 10:18:14,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:14,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 15 transitions. [2020-06-22 10:18:14,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:18:14,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 15 transitions. [2020-06-22 10:18:14,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 10:18:14,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 10:18:14,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2020-06-22 10:18:14,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:18:14,693 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-06-22 10:18:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2020-06-22 10:18:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-06-22 10:18:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 10:18:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 10:18:14,695 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 10:18:14,695 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 10:18:14,695 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:18:14,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-06-22 10:18:14,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:18:14,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:14,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:14,696 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:18:14,696 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:18:14,697 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY [60] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_16 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_14 10000)) (<= v_ULTIMATE.start_main_~z~0_12 10000) (<= v_ULTIMATE.start_main_~x~0_14 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_16, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 143#L22-2 [48] L22-2-->L24-2: Formula: (and (<= 1 v_ULTIMATE.start_main_~y~0_8) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 144#L24-2 [44] L24-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1)) (< v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 145#L24-2 [2020-06-22 10:18:14,697 INFO L796 eck$LassoCheckResult]: Loop: 145#L24-2 [58] L24-2-->L22-2: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_15 v_ULTIMATE.start_main_~x~0_13) v_ULTIMATE.start_main_~y~0_14) (<= v_ULTIMATE.start_main_~z~0_11 v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 147#L22-2 [48] L22-2-->L24-2: Formula: (and (<= 1 v_ULTIMATE.start_main_~y~0_8) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 148#L24-2 [44] L24-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1)) (< v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 145#L24-2 [2020-06-22 10:18:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,697 INFO L82 PathProgramCache]: Analyzing trace with hash 88983, now seen corresponding path program 3 times [2020-06-22 10:18:14,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:14,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,706 INFO L82 PathProgramCache]: Analyzing trace with hash 87061, now seen corresponding path program 1 times [2020-06-22 10:18:14,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:14,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1644017473, now seen corresponding path program 1 times [2020-06-22 10:18:14,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:14,774 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:14,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:14,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:14,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:14,775 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:18:14,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:14,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:14,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 10:18:14,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:14,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:14,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:14,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:14,874 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:18:14,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:18:14,905 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 10:18:14,905 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:18:14,912 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:14,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:18:14,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:18:15,138 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:18:15,141 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:15,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:15,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:15,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:15,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:15,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:15,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:15,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:15,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 10:18:15,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:15,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:15,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:15,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:15,214 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:15,214 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:15,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:15,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:15,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:15,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:15,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:15,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:15,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:15,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:15,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:15,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:15,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:15,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:15,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:15,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:15,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:15,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:15,231 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:18:15,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:18:15,236 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:18:15,237 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:18:15,237 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:18:15,237 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:18:15,237 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-06-22 10:18:15,237 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:18:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:15,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:18:15,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:15,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:18:15,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:18:15,303 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:18:15,303 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:18:15,303 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-06-22 10:18:15,340 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 18 states and 33 transitions. Complement of second has 12 states. [2020-06-22 10:18:15,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 10:18:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:18:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-06-22 10:18:15,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 10:18:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 10:18:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:18:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:15,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 33 transitions. [2020-06-22 10:18:15,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:18:15,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 33 transitions. [2020-06-22 10:18:15,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 10:18:15,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 10:18:15,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 33 transitions. [2020-06-22 10:18:15,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:18:15,349 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 33 transitions. [2020-06-22 10:18:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 33 transitions. [2020-06-22 10:18:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-06-22 10:18:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:18:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2020-06-22 10:18:15,352 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-22 10:18:15,353 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-22 10:18:15,353 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:18:15,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 24 transitions. [2020-06-22 10:18:15,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 10:18:15,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:15,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:15,354 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:18:15,354 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:18:15,355 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY [60] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_16 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_14 10000)) (<= v_ULTIMATE.start_main_~z~0_12 10000) (<= v_ULTIMATE.start_main_~x~0_14 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_16, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 222#L22-2 [48] L22-2-->L24-2: Formula: (and (<= 1 v_ULTIMATE.start_main_~y~0_8) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 226#L24-2 [44] L24-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 1)) (< v_ULTIMATE.start_main_~y~0_10 v_ULTIMATE.start_main_~z~0_9) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_9 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 231#L24-2 [58] L24-2-->L22-2: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_15 v_ULTIMATE.start_main_~x~0_13) v_ULTIMATE.start_main_~y~0_14) (<= v_ULTIMATE.start_main_~z~0_11 v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 224#L22-2 [2020-06-22 10:18:15,355 INFO L796 eck$LassoCheckResult]: Loop: 224#L22-2 [48] L22-2-->L24-2: Formula: (and (<= 1 v_ULTIMATE.start_main_~y~0_8) (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 223#L24-2 [58] L24-2-->L22-2: Formula: (and (= (+ v_ULTIMATE.start_main_~y~0_15 v_ULTIMATE.start_main_~x~0_13) v_ULTIMATE.start_main_~y~0_14) (<= v_ULTIMATE.start_main_~z~0_11 v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 224#L22-2 [2020-06-22 10:18:15,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:15,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2758531, now seen corresponding path program 2 times [2020-06-22 10:18:15,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:15,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2507, now seen corresponding path program 2 times [2020-06-22 10:18:15,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:15,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:15,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:15,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:15,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:15,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1644017459, now seen corresponding path program 3 times [2020-06-22 10:18:15,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:15,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:15,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:15,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:18:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:15,404 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:15,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:15,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:15,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:15,405 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 10:18:15,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:15,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:15,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:15,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 10:18:15,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:15,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:15,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:15,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:15,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:15,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:15,479 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:18:15,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 10:18:15,485 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 10:18:15,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 10:18:15,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 10:18:17,737 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 10:18:17,740 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:17,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:17,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:17,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:17,741 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:17,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:17,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:17,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:17,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 10:18:17,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:17,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:17,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:17,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:17,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:18:17,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:17,793 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:17,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:17,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:17,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:17,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:17,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:17,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:17,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:18:17,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:17,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:17,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:17,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:17,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:17,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:17,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:17,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:17,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:17,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:17,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:17,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:17,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:17,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:17,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:17,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:17,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:17,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:17,811 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 10:18:17,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:18:17,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:17,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:18:17,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:17,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:17,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 10:18:17,814 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 10:18:17,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:18:17,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:18:17,829 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 10:18:17,829 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:18:17,830 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:18:17,830 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:18:17,830 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:18:17,830 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 10:18:17,831 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 10:18:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:17,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:18:17,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:17,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:18:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:18:18,058 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization [2020-06-22 10:18:18,058 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 12 loop predicates [2020-06-22 10:18:18,074 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-06-22 10:18:18,526 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 128 states and 219 transitions. Complement of second has 46 states. [2020-06-22 10:18:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 10:18:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:18:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-06-22 10:18:18,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 10:18:18,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:18,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:18:18,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:18,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 10:18:18,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:18,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 219 transitions. [2020-06-22 10:18:18,537 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:18:18,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 0 states and 0 transitions. [2020-06-22 10:18:18,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:18:18,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:18:18,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:18:18,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:18:18,538 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:18:18,538 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:18:18,538 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:18:18,538 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:18:18,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:18:18,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:18:18,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:18:18,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:18 BasicIcfg [2020-06-22 10:18:18,545 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:18:18,545 INFO L168 Benchmark]: Toolchain (without parser) took 9047.52 ms. Allocated memory was 649.6 MB in the beginning and 756.5 MB in the end (delta: 107.0 MB). Free memory was 559.9 MB in the beginning and 454.0 MB in the end (delta: 105.9 MB). Peak memory consumption was 212.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,547 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 581.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:18:18,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.50 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 559.9 MB in the beginning and 660.7 MB in the end (delta: -100.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 694.2 MB. Free memory was 660.7 MB in the beginning and 658.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,549 INFO L168 Benchmark]: Boogie Preprocessor took 19.48 ms. Allocated memory is still 694.2 MB. Free memory was 658.0 MB in the beginning and 654.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,549 INFO L168 Benchmark]: RCFGBuilder took 211.02 ms. Allocated memory is still 694.2 MB. Free memory was 654.9 MB in the beginning and 641.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,550 INFO L168 Benchmark]: BlockEncodingV2 took 84.14 ms. Allocated memory is still 694.2 MB. Free memory was 641.8 MB in the beginning and 636.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,551 INFO L168 Benchmark]: TraceAbstraction took 157.53 ms. Allocated memory is still 694.2 MB. Free memory was 635.1 MB in the beginning and 626.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,551 INFO L168 Benchmark]: BuchiAutomizer took 8257.00 ms. Allocated memory was 694.2 MB in the beginning and 756.5 MB in the end (delta: 62.4 MB). Free memory was 626.9 MB in the beginning and 454.0 MB in the end (delta: 172.8 MB). Peak memory consumption was 235.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:18,555 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 13 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 581.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 278.50 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 559.9 MB in the beginning and 660.7 MB in the end (delta: -100.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.61 ms. Allocated memory is still 694.2 MB. Free memory was 660.7 MB in the beginning and 658.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.48 ms. Allocated memory is still 694.2 MB. Free memory was 658.0 MB in the beginning and 654.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 211.02 ms. Allocated memory is still 694.2 MB. Free memory was 654.9 MB in the beginning and 641.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 84.14 ms. Allocated memory is still 694.2 MB. Free memory was 641.8 MB in the beginning and 636.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 157.53 ms. Allocated memory is still 694.2 MB. Free memory was 635.1 MB in the beginning and 626.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 8257.00 ms. Allocated memory was 694.2 MB in the beginning and 756.5 MB in the end (delta: 62.4 MB). Free memory was 626.9 MB in the beginning and 454.0 MB in the end (delta: 172.8 MB). Peak memory consumption was 235.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 10 locations. One nondeterministic module has affine ranking function z + -1 * y and consists of 2 locations. One nondeterministic module has affine ranking function z and consists of 5 locations. One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 17 SDtfs, 40 SDslu, 1 SDs, 0 SdLazy, 91 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf93 smp100 dnf100 smp100 tf108 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:18:06.204 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:18:18.789 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check