YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:06:39,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:06:39,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:06:39,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:06:39,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:06:39,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:06:39,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:06:39,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:06:39,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:06:39,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:06:39,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:06:39,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:06:39,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:06:39,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:06:39,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:06:39,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:06:39,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:06:39,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:06:39,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:06:39,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:06:39,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:06:39,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:06:39,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:06:39,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:06:39,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:06:39,098 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:06:39,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:06:39,099 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:06:39,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:06:39,100 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:06:39,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:06:39,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:06:39,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:06:39,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:06:39,103 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:06:39,103 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:06:39,104 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:06:39,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:06:39,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:06:39,105 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 04:06:39,120 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:06:39,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:06:39,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:06:39,121 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:06:39,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:06:39,122 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:06:39,122 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:06:39,122 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:06:39,122 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:06:39,122 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:06:39,122 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:06:39,123 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:06:39,123 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:06:39,123 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:06:39,123 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:39,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:06:39,123 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:06:39,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:06:39,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:06:39,124 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:06:39,124 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:06:39,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:06:39,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:06:39,125 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:06:39,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:06:39,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:06:39,125 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:06:39,125 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:06:39,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:06:39,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:06:39,164 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:06:39,168 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:06:39,169 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:06:39,169 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:06:39,170 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:06:39,258 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/fe0c62822ff049d8846ff27dccb084dc/FLAGbf7f82d86 [2020-06-22 04:06:39,602 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:06:39,603 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:06:39,609 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/fe0c62822ff049d8846ff27dccb084dc/FLAGbf7f82d86 [2020-06-22 04:06:40,024 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/fe0c62822ff049d8846ff27dccb084dc [2020-06-22 04:06:40,035 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:06:40,036 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:06:40,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:06:40,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:06:40,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:06:40,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b098119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:06:40,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:06:40,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:06:40,230 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:06:40,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:06:40,317 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:06:40,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40 WrapperNode [2020-06-22 04:06:40,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:06:40,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:06:40,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:06:40,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:06:40,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:06:40,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:06:40,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:06:40,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:06:40,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:06:40,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:06:40,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:06:40,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:06:40,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:06:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:06:40,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:06:40,586 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:06:40,586 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 04:06:40,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:06:40 BoogieIcfgContainer [2020-06-22 04:06:40,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:06:40,588 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:06:40,589 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:06:40,591 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:06:40,592 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:06:40" (1/1) ... [2020-06-22 04:06:40,608 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 17 edges [2020-06-22 04:06:40,610 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:06:40,610 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:06:40,611 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:06:40,611 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:06:40,613 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:06:40,614 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:06:40,614 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:06:40,629 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:06:40,645 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 04:06:40,649 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 04:06:40,651 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:06:40,664 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 04:06:40,667 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states [2020-06-22 04:06:40,668 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:06:40,668 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:06:40,674 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 04:06:40,674 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:06:40,675 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:06:40,675 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:06:40,675 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:06:40,675 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:06:40,676 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 6 edges [2020-06-22 04:06:40,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:06:40 BasicIcfg [2020-06-22 04:06:40,676 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:06:40,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:06:40,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:06:40,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:06:40,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:06:40" (1/4) ... [2020-06-22 04:06:40,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1e7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (2/4) ... [2020-06-22 04:06:40,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1e7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:06:40" (3/4) ... [2020-06-22 04:06:40,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1e7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:06:40" (4/4) ... [2020-06-22 04:06:40,688 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:06:40,699 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:06:40,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:06:40,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:06:40,753 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:06:40,754 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:06:40,754 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:06:40,754 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:06:40,754 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:06:40,754 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:06:40,755 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:06:40,755 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:06:40,755 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:06:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 04:06:40,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:06:40,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 04:06:40,833 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:06:40,834 INFO L451 ceAbstractionStarter]: At program point L28-2(lines 28 30) the Hoare annotation is: true [2020-06-22 04:06:40,834 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: true [2020-06-22 04:06:40,834 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: true [2020-06-22 04:06:40,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:06:40 BasicIcfg [2020-06-22 04:06:40,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:06:40,843 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:06:40,843 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:06:40,846 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:06:40,847 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:06:40,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:06:40" (1/5) ... [2020-06-22 04:06:40,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4efd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,848 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:06:40,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:06:40" (2/5) ... [2020-06-22 04:06:40,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4efd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:06:40,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:06:40" (3/5) ... [2020-06-22 04:06:40,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4efd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,850 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:06:40,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:06:40" (4/5) ... [2020-06-22 04:06:40,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4efd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:06:40, skipping insertion in model container [2020-06-22 04:06:40,850 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:06:40,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:06:40" (5/5) ... [2020-06-22 04:06:40,852 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:06:40,880 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:06:40,880 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:06:40,880 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:06:40,880 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:06:40,880 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:06:40,881 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:06:40,881 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:06:40,881 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:06:40,881 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:06:40,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 04:06:40,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:06:40,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:06:40,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:06:40,906 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:06:40,907 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:06:40,907 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:06:40,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 04:06:40,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:06:40,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:06:40,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:06:40,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:06:40,908 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:06:40,913 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 4#L23-2true [2020-06-22 04:06:40,914 INFO L796 eck$LassoCheckResult]: Loop: 4#L23-2true [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 6#L25-2true [75] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= v_ULTIMATE.start_main_~m~0_10 v_ULTIMATE.start_main_~j~0_10)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 4#L23-2true [2020-06-22 04:06:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2020-06-22 04:06:40,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:40,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:40,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:40,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:40,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2803, now seen corresponding path program 1 times [2020-06-22 04:06:40,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:40,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:40,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:40,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:40,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 106591, now seen corresponding path program 1 times [2020-06-22 04:06:41,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:41,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,063 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:41,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:41,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:41,064 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:41,064 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:06:41,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:41,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:41,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:41,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:06:41,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:41,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:41,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:41,187 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:41,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:41,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:41,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:06:41,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:41,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:41,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:41,261 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:06:41,261 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:41,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:41,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:41,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:06:41,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=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 04:06:41,302 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:41,302 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 04:06:41,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:06:41,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:41,495 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:06:41,497 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:41,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:41,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:41,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:41,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:06:41,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:06:41,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:41,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:41,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 04:06:41,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:41,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:41,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:41,620 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:06:41,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:41,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:41,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:41,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:41,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:41,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:06:41,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:06:41,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:41,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:41,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:41,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:41,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:41,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:41,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:06:41,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:06:41,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:41,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:41,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:41,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:41,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:41,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:41,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:41,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:41,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:41,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:41,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:41,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:41,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:41,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:41,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:41,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:41,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:41,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:41,663 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:06:41,672 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 04:06:41,673 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:06:41,675 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:06:41,675 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:06:41,675 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:06:41,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 04:06:41,677 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:06:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:41,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:06:41,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:41,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:06:41,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:06:41,785 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 04:06:41,789 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 04:06:41,791 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. [2020-06-22 04:06:41,823 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 16 transitions. Complement of second has 4 states. [2020-06-22 04:06:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:06:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:06:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 04:06:41,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 04:06:41,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:41,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 04:06:41,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:41,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 04:06:41,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:41,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 16 transitions. [2020-06-22 04:06:41,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-06-22 04:06:41,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 14 transitions. [2020-06-22 04:06:41,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 04:06:41,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 04:06:41,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2020-06-22 04:06:41,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:06:41,844 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 04:06:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2020-06-22 04:06:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-06-22 04:06:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 04:06:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 04:06:41,871 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 04:06:41,871 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 04:06:41,871 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:06:41,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-06-22 04:06:41,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:06:41,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:06:41,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:06:41,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:06:41,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:06:41,873 INFO L794 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 54#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 52#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 47#L28-2 [2020-06-22 04:06:41,874 INFO L796 eck$LassoCheckResult]: Loop: 47#L28-2 [52] L28-2-->L28-2: Formula: (and (< v_ULTIMATE.start_main_~k~0_10 v_ULTIMATE.start_main_~N~0_9) (= v_ULTIMATE.start_main_~k~0_9 (+ v_ULTIMATE.start_main_~k~0_10 1))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 47#L28-2 [2020-06-22 04:06:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 106578, now seen corresponding path program 1 times [2020-06-22 04:06:41,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2020-06-22 04:06:41,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:41,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash 3303970, now seen corresponding path program 1 times [2020-06-22 04:06:41,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:41,917 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:41,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:41,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:41,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:41,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:06:41,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:41,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:41,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:41,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:06:41,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:41,918 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:41,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:41,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:41,967 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 04:06:41,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:41,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:41,999 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:06:41,999 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:42,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:42,006 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 04:06:42,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:06:42,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:42,225 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:06:42,228 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:42,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:42,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:42,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:42,229 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:06:42,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:06:42,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:42,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:42,230 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:06:42,230 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:42,230 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:42,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,289 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:42,289 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:06:42,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:42,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:42,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:42,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:42,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:42,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:06:42,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:06:42,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:42,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:42,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:42,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:42,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:42,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:42,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:42,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:42,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:42,305 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:06:42,309 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:06:42,309 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:06:42,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:06:42,310 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:06:42,310 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:06:42,310 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2020-06-22 04:06:42,310 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:06:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:42,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:06:42,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:42,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:06:42,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:06:42,350 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 04:06:42,351 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 04:06:42,351 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 2 states. [2020-06-22 04:06:42,362 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 2 states. Result 12 states and 20 transitions. Complement of second has 4 states. [2020-06-22 04:06:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:06:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 04:06:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 04:06:42,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 1 letters. [2020-06-22 04:06:42,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:42,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 1 letters. [2020-06-22 04:06:42,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:42,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 04:06:42,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:42,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 20 transitions. [2020-06-22 04:06:42,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:06:42,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 16 transitions. [2020-06-22 04:06:42,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 04:06:42,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 04:06:42,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 16 transitions. [2020-06-22 04:06:42,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:06:42,369 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-06-22 04:06:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 16 transitions. [2020-06-22 04:06:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-06-22 04:06:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 04:06:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 04:06:42,371 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 04:06:42,371 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 04:06:42,371 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:06:42,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-06-22 04:06:42,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:06:42,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:06:42,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:06:42,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:06:42,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:06:42,373 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 106#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 104#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 98#L28-2 [2020-06-22 04:06:42,373 INFO L796 eck$LassoCheckResult]: Loop: 98#L28-2 [77] L28-2-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_10 v_ULTIMATE.start_main_~k~0_11) (= v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~k~0_11)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 100#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 98#L28-2 [2020-06-22 04:06:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash 106578, now seen corresponding path program 2 times [2020-06-22 04:06:42,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3410, now seen corresponding path program 1 times [2020-06-22 04:06:42,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:06:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 102423907, now seen corresponding path program 1 times [2020-06-22 04:06:42,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:42,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:42,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,440 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:42,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:42,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:42,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:42,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:06:42,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:42,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:42,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:42,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:06:42,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:42,441 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:42,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,526 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:42,526 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 04:06:42,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:42,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:42,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:06:42,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=-8} Honda state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~N~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:42,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:42,574 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:42,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:06:42,603 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:42,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:42,610 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:42,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:06:42,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:42,824 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:06:42,826 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:42,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:42,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:42,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:42,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:06:42,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:06:42,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:42,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:42,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:06:42,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:42,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:42,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:42,906 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:42,906 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:06:42,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:42,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:42,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:42,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:42,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:42,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:42,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:42,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:42,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:42,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:42,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:42,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:42,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:42,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:42,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:06:42,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:06:42,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:42,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:42,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:42,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:42,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:42,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:42,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:42,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:42,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:42,925 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:06:42,929 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 04:06:42,929 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:06:42,930 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:06:42,930 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:06:42,930 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:06:42,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-06-22 04:06:42,930 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:06:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:42,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:06:42,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:42,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:06:42,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:06:42,961 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 04:06:42,961 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 04:06:42,961 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 04:06:42,977 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 17 states and 29 transitions. Complement of second has 4 states. [2020-06-22 04:06:42,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:06:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:06:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-06-22 04:06:42,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 04:06:42,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:42,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 04:06:42,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:42,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 04:06:42,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:42,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 29 transitions. [2020-06-22 04:06:42,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 04:06:42,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 28 transitions. [2020-06-22 04:06:42,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 04:06:42,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 04:06:42,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 28 transitions. [2020-06-22 04:06:42,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:06:42,984 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-06-22 04:06:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 28 transitions. [2020-06-22 04:06:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-06-22 04:06:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 04:06:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2020-06-22 04:06:42,986 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-22 04:06:42,986 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-22 04:06:42,986 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:06:42,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 24 transitions. [2020-06-22 04:06:42,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 04:06:42,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:06:42,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:06:42,987 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:06:42,987 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 04:06:42,988 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 169#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 167#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 158#L28-2 [2020-06-22 04:06:42,988 INFO L796 eck$LassoCheckResult]: Loop: 158#L28-2 [77] L28-2-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_10 v_ULTIMATE.start_main_~k~0_11) (= v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~k~0_11)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 162#L25-2 [75] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= v_ULTIMATE.start_main_~m~0_10 v_ULTIMATE.start_main_~j~0_10)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 163#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 164#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 158#L28-2 [2020-06-22 04:06:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash 106578, now seen corresponding path program 3 times [2020-06-22 04:06:42,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:42,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:42,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:42,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 3291332, now seen corresponding path program 1 times [2020-06-22 04:06:42,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:42,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:06:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -354858859, now seen corresponding path program 1 times [2020-06-22 04:06:43,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:43,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:43,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:43,056 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:43,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:43,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:43,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:43,056 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:06:43,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:43,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:43,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:43,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:06:43,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:43,057 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:43,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:43,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:43,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:43,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:43,170 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:43,170 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:43,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:43,176 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:43,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:06:43,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:55,247 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 04:06:55,250 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:55,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:55,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:55,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:55,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:06:55,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:06:55,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:55,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:55,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:06:55,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:55,252 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:55,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:55,320 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:06:55,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:55,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:55,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:55,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:55,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:55,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:55,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:55,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:55,328 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:06:55,333 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 04:06:55,333 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:06:55,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:06:55,333 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:06:55,333 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:06:55,334 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~k~0 Supporting invariants [] [2020-06-22 04:06:55,334 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:06:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:55,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:06:55,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:55,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:06:55,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:55,392 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 04:06:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,405 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 04:06:55,405 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 04:06:55,405 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 4 loop predicates [2020-06-22 04:06:55,406 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-06-22 04:06:55,545 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 92 transitions. Complement of second has 22 states. [2020-06-22 04:06:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 04:06:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 04:06:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-06-22 04:06:55,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 04:06:55,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:55,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2020-06-22 04:06:55,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:55,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 04:06:55,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:55,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 92 transitions. [2020-06-22 04:06:55,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:06:55,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 35 states and 74 transitions. [2020-06-22 04:06:55,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 04:06:55,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 04:06:55,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 74 transitions. [2020-06-22 04:06:55,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:06:55,556 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 74 transitions. [2020-06-22 04:06:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 74 transitions. [2020-06-22 04:06:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2020-06-22 04:06:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 04:06:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2020-06-22 04:06:55,560 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-06-22 04:06:55,560 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-06-22 04:06:55,560 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:06:55,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2020-06-22 04:06:55,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:06:55,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:06:55,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:06:55,562 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 04:06:55,562 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:06:55,562 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L23-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0_11) (<= 0 v_ULTIMATE.start_main_~n~0_10) (= 0 v_ULTIMATE.start_main_~i~0_16) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_12, 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 303#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 305#L25-2 [62] L25-2-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_8 (+ v_ULTIMATE.start_main_~j~0_9 1)) (= v_ULTIMATE.start_main_~k~0_7 v_ULTIMATE.start_main_~i~0_12) (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~m~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 290#L28-2 [77] L28-2-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_10 v_ULTIMATE.start_main_~k~0_11) (= v_ULTIMATE.start_main_~i~0_15 v_ULTIMATE.start_main_~k~0_11)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_11, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 298#L25-2 [2020-06-22 04:06:55,562 INFO L796 eck$LassoCheckResult]: Loop: 298#L25-2 [75] L25-2-->L23-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_14 1) v_ULTIMATE.start_main_~i~0_13) (<= v_ULTIMATE.start_main_~m~0_10 v_ULTIMATE.start_main_~j~0_10)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 299#L23-2 [57] L23-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~j~0_6 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 298#L25-2 [2020-06-22 04:06:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash 3303995, now seen corresponding path program 2 times [2020-06-22 04:06:55,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:55,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:55,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:55,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:06:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 3343, now seen corresponding path program 2 times [2020-06-22 04:06:55,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:55,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:55,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:06:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1119825719, now seen corresponding path program 2 times [2020-06-22 04:06:55,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:06:55,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:06:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:55,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:06:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:06:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:06:55,614 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:55,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:55,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:55,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:55,614 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:06:55,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:55,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:55,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:55,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:06:55,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:55,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:55,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:55,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:55,672 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:55,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:06:55,677 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:06:55,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:06:55,710 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:06:56,096 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:06:56,098 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:06:56,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:06:56,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:06:56,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:06:56,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:06:56,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:06:56,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:06:56,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:06:56,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 04:06:56,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:06:56,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:06:56,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:56,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:56,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:56,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:06:56,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:06:56,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:06:56,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:56,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:56,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:56,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:56,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:56,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:06:56,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:06:56,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:06:56,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 04:06:56,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:06:56,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:06:56,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:06:56,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:06:56,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:06:56,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:06:56,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:06:56,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:06:56,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:06:56,168 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:06:56,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:06:56,168 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:06:56,168 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:06:56,169 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 04:06:56,169 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:06:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:06:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:56,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:06:56,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:06:56,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:06:56,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:06:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:06:56,204 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 04:06:56,204 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 04:06:56,204 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-06-22 04:06:56,229 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32. Second operand 3 states. Result 34 states and 75 transitions. Complement of second has 6 states. [2020-06-22 04:06:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 04:06:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:06:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-06-22 04:06:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 04:06:56,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 04:06:56,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:56,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 04:06:56,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:06:56,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 75 transitions. [2020-06-22 04:06:56,233 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:06:56,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2020-06-22 04:06:56,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:06:56,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:06:56,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:06:56,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:06:56,234 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:06:56,234 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:06:56,234 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:06:56,234 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:06:56,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:06:56,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:06:56,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:06:56,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:06:56 BasicIcfg [2020-06-22 04:06:56,241 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:06:56,241 INFO L168 Benchmark]: Toolchain (without parser) took 16205.88 ms. Allocated memory was 649.6 MB in the beginning and 751.8 MB in the end (delta: 102.2 MB). Free memory was 560.6 MB in the beginning and 580.6 MB in the end (delta: -19.9 MB). Peak memory consumption was 82.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,243 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:06:56,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.82 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 559.6 MB in the beginning and 640.5 MB in the end (delta: -80.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.74 ms. Allocated memory is still 674.8 MB. Free memory was 640.5 MB in the beginning and 637.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,245 INFO L168 Benchmark]: Boogie Preprocessor took 19.82 ms. Allocated memory is still 674.8 MB. Free memory was 637.6 MB in the beginning and 635.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,245 INFO L168 Benchmark]: RCFGBuilder took 214.55 ms. Allocated memory is still 674.8 MB. Free memory was 635.5 MB in the beginning and 620.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,246 INFO L168 Benchmark]: BlockEncodingV2 took 87.82 ms. Allocated memory is still 674.8 MB. Free memory was 620.9 MB in the beginning and 614.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,246 INFO L168 Benchmark]: TraceAbstraction took 165.36 ms. Allocated memory is still 674.8 MB. Free memory was 614.5 MB in the beginning and 605.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,247 INFO L168 Benchmark]: BuchiAutomizer took 15397.68 ms. Allocated memory was 674.8 MB in the beginning and 751.8 MB in the end (delta: 77.1 MB). Free memory was 604.7 MB in the beginning and 580.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 101.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:06:56,251 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 17 edges - StatisticsResult: Encoded RCFG 4 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 280.82 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 559.6 MB in the beginning and 640.5 MB in the end (delta: -80.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.74 ms. Allocated memory is still 674.8 MB. Free memory was 640.5 MB in the beginning and 637.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.82 ms. Allocated memory is still 674.8 MB. Free memory was 637.6 MB in the beginning and 635.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 214.55 ms. Allocated memory is still 674.8 MB. Free memory was 635.5 MB in the beginning and 620.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 87.82 ms. Allocated memory is still 674.8 MB. Free memory was 620.9 MB in the beginning and 614.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 165.36 ms. Allocated memory is still 674.8 MB. Free memory was 614.5 MB in the beginning and 605.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 15397.68 ms. Allocated memory was 674.8 MB in the beginning and 751.8 MB in the end (delta: 77.1 MB). Free memory was 604.7 MB in the beginning and 580.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 101.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: 28]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 3 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function n + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 3 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. One nondeterministic module has affine ranking function n + -1 * k and consists of 8 locations. One nondeterministic module has affine ranking function n + -1 * i and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 14.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 40 SDtfs, 47 SDslu, 7 SDs, 0 SdLazy, 65 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax176 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf92 smp100 dnf100 smp100 tf112 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:06:36.742 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 04:06:56.485 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check