YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 03:26:26,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 03:26:26,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 03:26:26,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 03:26:26,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 03:26:26,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 03:26:26,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 03:26:26,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 03:26:26,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 03:26:26,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 03:26:26,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 03:26:26,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 03:26:26,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 03:26:26,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 03:26:26,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 03:26:26,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 03:26:26,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 03:26:26,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 03:26:26,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 03:26:26,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 03:26:26,712 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 03:26:26,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 03:26:26,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 03:26:26,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 03:26:26,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 03:26:26,716 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 03:26:26,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 03:26:26,718 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 03:26:26,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 03:26:26,718 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 03:26:26,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 03:26:26,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 03:26:26,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 03:26:26,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 03:26:26,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 03:26:26,722 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 03:26:26,722 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 03:26:26,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 03:26:26,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 03:26:26,724 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 03:26:26,738 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 03:26:26,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 03:26:26,740 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 03:26:26,740 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 03:26:26,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 03:26:26,740 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:26:26,740 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 03:26:26,740 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 03:26:26,741 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 03:26:26,741 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 03:26:26,741 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 03:26:26,741 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 03:26:26,741 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 03:26:26,741 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 03:26:26,742 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:26,742 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 03:26:26,742 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 03:26:26,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 03:26:26,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 03:26:26,742 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 03:26:26,743 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 03:26:26,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 03:26:26,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 03:26:26,743 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 03:26:26,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:26:26,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 03:26:26,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 03:26:26,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 03:26:26,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 03:26:26,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 03:26:26,783 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 03:26:26,786 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 03:26:26,788 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 03:26:26,788 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 03:26:26,789 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 03:26:26,849 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/0252951171d74379ab16cdfbde8f1323/FLAG9d81b00db [2020-06-22 03:26:27,183 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 03:26:27,184 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 03:26:27,190 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/0252951171d74379ab16cdfbde8f1323/FLAG9d81b00db [2020-06-22 03:26:27,588 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/0252951171d74379ab16cdfbde8f1323 [2020-06-22 03:26:27,599 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 03:26:27,601 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 03:26:27,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 03:26:27,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 03:26:27,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 03:26:27,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e290fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27, skipping insertion in model container [2020-06-22 03:26:27,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 03:26:27,634 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 03:26:27,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:26:27,791 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 03:26:27,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:26:27,875 INFO L195 MainTranslator]: Completed translation [2020-06-22 03:26:27,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27 WrapperNode [2020-06-22 03:26:27,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 03:26:27,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 03:26:27,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 03:26:27,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 03:26:27,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 03:26:27,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 03:26:27,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 03:26:27,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 03:26:27,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (1/1) ... [2020-06-22 03:26:27,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 03:26:27,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 03:26:27,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 03:26:27,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 03:26:27,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (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 03:26:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 03:26:28,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 03:26:28,137 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 03:26:28,137 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 03:26:28,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:26:28 BoogieIcfgContainer [2020-06-22 03:26:28,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 03:26:28,139 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 03:26:28,139 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 03:26:28,142 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 03:26:28,142 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:26:28" (1/1) ... [2020-06-22 03:26:28,157 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 12 edges [2020-06-22 03:26:28,159 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 03:26:28,160 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 03:26:28,161 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 03:26:28,161 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:26:28,163 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 03:26:28,164 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 03:26:28,164 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 03:26:28,181 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 03:26:28,198 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 03:26:28,203 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 03:26:28,205 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:26:28,214 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 03:26:28,216 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 03:26:28,217 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:26:28,217 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:26:28,218 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 03:26:28,218 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:26:28,218 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges [2020-06-22 03:26:28,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:26:28 BasicIcfg [2020-06-22 03:26:28,219 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 03:26:28,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 03:26:28,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 03:26:28,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 03:26:28,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 03:26:27" (1/4) ... [2020-06-22 03:26:28,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b55ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (2/4) ... [2020-06-22 03:26:28,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b55ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:26:28" (3/4) ... [2020-06-22 03:26:28,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b55ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:26:28" (4/4) ... [2020-06-22 03:26:28,228 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:26:28,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 03:26:28,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 03:26:28,265 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 03:26:28,295 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:26:28,296 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 03:26:28,296 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 03:26:28,297 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:26:28,297 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:26:28,297 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:26:28,297 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 03:26:28,297 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:26:28,297 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 03:26:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-06-22 03:26:28,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 03:26:28,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-06-22 03:26:28,373 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2020-06-22 03:26:28,373 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 29) no Hoare annotation was computed. [2020-06-22 03:26:28,373 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 03:26:28,374 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 28) no Hoare annotation was computed. [2020-06-22 03:26:28,374 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 14 30) the Hoare annotation is: true [2020-06-22 03:26:28,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:26:28 BasicIcfg [2020-06-22 03:26:28,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 03:26:28,384 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 03:26:28,384 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 03:26:28,388 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 03:26:28,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:26:28,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 03:26:27" (1/5) ... [2020-06-22 03:26:28,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681c12d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:26:28,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:26:27" (2/5) ... [2020-06-22 03:26:28,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681c12d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:26:28,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:26:28" (3/5) ... [2020-06-22 03:26:28,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681c12d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:26:28,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:26:28" (4/5) ... [2020-06-22 03:26:28,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681c12d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:26:28, skipping insertion in model container [2020-06-22 03:26:28,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:26:28,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:26:28" (5/5) ... [2020-06-22 03:26:28,394 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:26:28,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:26:28,427 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 03:26:28,427 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 03:26:28,428 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:26:28,428 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:26:28,428 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:26:28,428 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 03:26:28,428 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:26:28,428 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 03:26:28,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 03:26:28,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:26:28,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:28,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:28,457 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:26:28,457 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:26:28,457 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 03:26:28,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-06-22 03:26:28,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:26:28,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:28,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:28,459 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:26:28,459 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:26:28,464 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 4#L23-2true [2020-06-22 03:26:28,465 INFO L796 eck$LassoCheckResult]: Loop: 4#L23-2true [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 3#L15true [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 6#L16true [54] L16-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_2|) (= v_ULTIMATE.start_main_~x~0_1 (+ v_ULTIMATE.start_main_~x~0_2 (- 1))) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_2|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 4#L23-2true [2020-06-22 03:26:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2020-06-22 03:26:28,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:28,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:28,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash 80840, now seen corresponding path program 1 times [2020-06-22 03:26:28,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:28,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:28,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:28,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:28,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2106628, now seen corresponding path program 1 times [2020-06-22 03:26:28,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:28,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:28,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:28,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:28,630 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:28,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:28,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:28,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:28,632 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:26:28,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:28,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:28,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:28,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 03:26:28,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:28,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:28,651 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 03:26:28,666 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 03:26:28,671 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 03:26:28,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:28,734 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 03:26:28,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:28,741 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:28,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:26:28,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:28,805 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:26:28,808 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:28,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:28,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:28,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:28,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:26:28,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:26:28,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:28,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:28,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 03:26:28,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:28,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:28,811 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 03:26:28,818 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 03:26:28,825 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 03:26:28,882 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:28,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:26:28,890 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 03:26:28,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:28,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:28,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:28,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:28,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:28,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:28,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:28,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:26:28,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:26:28,909 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:26:28,911 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:26:28,911 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:26:28,912 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:26:28,912 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 03:26:28,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:26:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:28,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:26:28,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:28,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:28,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:28,983 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 03:26:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:29,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:29,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:29,047 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 03:26:29,053 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 03:26:29,054 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 3 states. [2020-06-22 03:26:29,126 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 3 states. Result 22 states and 47 transitions. Complement of second has 7 states. [2020-06-22 03:26:29,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 03:26:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:26:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-06-22 03:26:29,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 03:26:29,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:29,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 03:26:29,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:29,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 03:26:29,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:29,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 47 transitions. [2020-06-22 03:26:29,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 03:26:29,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 34 transitions. [2020-06-22 03:26:29,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 03:26:29,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 03:26:29,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 34 transitions. [2020-06-22 03:26:29,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:26:29,148 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 34 transitions. [2020-06-22 03:26:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 34 transitions. [2020-06-22 03:26:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-06-22 03:26:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 03:26:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-06-22 03:26:29,178 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 29 transitions. [2020-06-22 03:26:29,178 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 29 transitions. [2020-06-22 03:26:29,178 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 03:26:29,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 29 transitions. [2020-06-22 03:26:29,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 03:26:29,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:29,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:29,180 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:26:29,180 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:26:29,181 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 83#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 75#L15 [2020-06-22 03:26:29,181 INFO L796 eck$LassoCheckResult]: Loop: 75#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 76#L16 [40] L16-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~y~0_6 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 79#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 75#L15 [2020-06-22 03:26:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2191, now seen corresponding path program 1 times [2020-06-22 03:26:29,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:29,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash 62796, now seen corresponding path program 1 times [2020-06-22 03:26:29,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:29,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash 65305086, now seen corresponding path program 1 times [2020-06-22 03:26:29,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,221 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:29,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:29,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:29,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:29,222 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:26:29,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:29,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:29,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:29,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 03:26:29,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:29,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:29,224 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 03:26:29,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 03:26:29,242 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 03:26:29,273 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:29,273 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:29,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:29,279 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:29,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:26:29,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:29,380 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:26:29,383 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:29,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:29,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:29,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:29,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:26:29,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:26:29,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:29,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:29,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 03:26:29,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:29,402 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:29,404 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 03:26:29,414 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 03:26:29,417 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 03:26:29,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:29,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:26:29,453 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 03:26:29,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:29,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:29,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:29,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:29,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:29,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:29,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:29,461 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:26:29,464 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:26:29,464 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:26:29,465 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:26:29,465 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:26:29,465 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:26:29,465 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 03:26:29,466 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:26:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:29,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:26:29,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:29,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:29,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:29,505 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 03:26:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:29,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:29,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:29,536 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 03:26:29,536 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 03:26:29,537 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 29 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-06-22 03:26:29,636 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 29 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 42 states and 80 transitions. Complement of second has 8 states. [2020-06-22 03:26:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 03:26:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:26:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-06-22 03:26:29,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 03:26:29,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:29,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 03:26:29,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:29,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 03:26:29,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:29,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 80 transitions. [2020-06-22 03:26:29,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 03:26:29,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 68 transitions. [2020-06-22 03:26:29,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 03:26:29,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 03:26:29,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 68 transitions. [2020-06-22 03:26:29,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:26:29,648 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 68 transitions. [2020-06-22 03:26:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 68 transitions. [2020-06-22 03:26:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-06-22 03:26:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 03:26:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2020-06-22 03:26:29,652 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 56 transitions. [2020-06-22 03:26:29,652 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 56 transitions. [2020-06-22 03:26:29,652 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 03:26:29,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 56 transitions. [2020-06-22 03:26:29,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 03:26:29,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:29,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:29,654 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 03:26:29,654 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:26:29,654 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 193#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 203#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 201#L23 [2020-06-22 03:26:29,655 INFO L796 eck$LassoCheckResult]: Loop: 201#L23 [56] L23-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 190#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 200#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 201#L23 [2020-06-22 03:26:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash 67999, now seen corresponding path program 1 times [2020-06-22 03:26:29,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:29,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash 85297, now seen corresponding path program 1 times [2020-06-22 03:26:29,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:29,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:29,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:29,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2025813715, now seen corresponding path program 1 times [2020-06-22 03:26:29,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:29,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:29,721 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:29,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:29,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:29,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:29,722 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:26:29,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:29,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:29,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:29,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 03:26:29,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:29,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:29,724 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 03:26:29,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:26:29,734 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 03:26:29,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:29,760 INFO L412 LassoAnalysis]: Checking for nontermination... 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 03:26:29,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:29,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:29,792 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:26:29,792 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 03:26:29,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:29,797 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 03:26:29,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:26:29,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:29,900 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:26:29,902 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:29,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:29,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:29,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:29,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:26:29,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:26:29,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:29,903 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:29,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 03:26:29,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:29,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:29,905 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 03:26:29,909 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 03:26:29,927 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 03:26:29,953 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:29,953 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:26:29,954 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 03:26:29,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:29,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:29,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:29,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:29,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:29,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:29,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:29,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:26:29,959 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 03:26:29,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:29,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:29,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:29,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:29,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:29,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:29,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:29,965 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:26:29,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:26:29,968 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:26:29,969 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:26:29,969 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:26:29,969 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:26:29,970 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 03:26:29,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:26:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:29,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:26:29,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,000 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:30,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:30,011 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 03:26:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:30,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:30,019 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 03:26:30,019 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 03:26:30,019 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 56 transitions. cyclomatic complexity: 31 Second operand 3 states. [2020-06-22 03:26:30,092 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 56 transitions. cyclomatic complexity: 31. Second operand 3 states. Result 96 states and 222 transitions. Complement of second has 9 states. [2020-06-22 03:26:30,093 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 03:26:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:26:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-06-22 03:26:30,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 03:26:30,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:30,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 03:26:30,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:30,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 03:26:30,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:30,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 222 transitions. [2020-06-22 03:26:30,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2020-06-22 03:26:30,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 95 states and 217 transitions. [2020-06-22 03:26:30,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 03:26:30,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-06-22 03:26:30,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 217 transitions. [2020-06-22 03:26:30,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:26:30,104 INFO L706 BuchiCegarLoop]: Abstraction has 95 states and 217 transitions. [2020-06-22 03:26:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 217 transitions. [2020-06-22 03:26:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2020-06-22 03:26:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-06-22 03:26:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2020-06-22 03:26:30,112 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 189 transitions. [2020-06-22 03:26:30,112 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 189 transitions. [2020-06-22 03:26:30,112 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 03:26:30,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 189 transitions. [2020-06-22 03:26:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2020-06-22 03:26:30,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:30,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:30,115 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 03:26:30,116 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:26:30,116 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 359#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 361#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 382#L23 [2020-06-22 03:26:30,116 INFO L796 eck$LassoCheckResult]: Loop: 382#L23 [43] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_11 |v_ULTIMATE.start_main_#t~nondet5_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 364#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 418#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 382#L23 [2020-06-22 03:26:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash 67999, now seen corresponding path program 2 times [2020-06-22 03:26:30,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash 72804, now seen corresponding path program 1 times [2020-06-22 03:26:30,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:26:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2025801222, now seen corresponding path program 1 times [2020-06-22 03:26:30,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,168 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:30,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:30,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:30,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:30,169 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:26:30,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:30,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:30,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:30,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 03:26:30,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:30,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:30,171 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 03:26:30,174 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 03:26:30,180 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 03:26:30,221 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:30,221 INFO L412 LassoAnalysis]: Checking for nontermination... 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 03:26:30,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:30,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:30,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:26:30,229 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:30,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:30,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:30,263 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:26:30,263 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=-1, ULTIMATE.start_main_~x~0=-1} Honda state: {ULTIMATE.start_main_#t~nondet5=-1, ULTIMATE.start_main_~x~0=-1} 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 03:26:30,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:30,295 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 03:26:30,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:26:30,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:30,395 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:26:30,397 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:30,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:30,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:30,397 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:30,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:26:30,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:26:30,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:30,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:30,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 03:26:30,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:30,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:30,400 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 03:26:30,403 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 03:26:30,408 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 03:26:30,442 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:30,442 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:26:30,443 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 03:26:30,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:30,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:30,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:30,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:30,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:30,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:30,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:30,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:26:30,446 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 03:26:30,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:30,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:30,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:30,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:30,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:30,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:30,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:30,468 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:26:30,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:26:30,474 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:26:30,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:26:30,474 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:26:30,474 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:26:30,474 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 03:26:30,475 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:26:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:26:30,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:30,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:30,525 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 03:26:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:30,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:30,540 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 03:26:30,540 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 03:26:30,540 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 82 states and 189 transitions. cyclomatic complexity: 109 Second operand 4 states. [2020-06-22 03:26:30,682 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 82 states and 189 transitions. cyclomatic complexity: 109. Second operand 4 states. Result 331 states and 893 transitions. Complement of second has 20 states. [2020-06-22 03:26:30,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 03:26:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:26:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-06-22 03:26:30,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-22 03:26:30,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:30,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 03:26:30,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:30,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 03:26:30,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:30,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 893 transitions. [2020-06-22 03:26:30,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2020-06-22 03:26:30,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 221 states and 510 transitions. [2020-06-22 03:26:30,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 03:26:30,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2020-06-22 03:26:30,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 510 transitions. [2020-06-22 03:26:30,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:26:30,701 INFO L706 BuchiCegarLoop]: Abstraction has 221 states and 510 transitions. [2020-06-22 03:26:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 510 transitions. [2020-06-22 03:26:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 114. [2020-06-22 03:26:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-06-22 03:26:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 281 transitions. [2020-06-22 03:26:30,712 INFO L729 BuchiCegarLoop]: Abstraction has 114 states and 281 transitions. [2020-06-22 03:26:30,712 INFO L609 BuchiCegarLoop]: Abstraction has 114 states and 281 transitions. [2020-06-22 03:26:30,712 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 03:26:30,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 281 transitions. [2020-06-22 03:26:30,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2020-06-22 03:26:30,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:30,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:30,714 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 03:26:30,714 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 03:26:30,715 INFO L794 eck$LassoCheckResult]: Stem: 847#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 848#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 907#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 869#L23 [2020-06-22 03:26:30,715 INFO L796 eck$LassoCheckResult]: Loop: 869#L23 [43] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_11 |v_ULTIMATE.start_main_#t~nondet5_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 902#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 886#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 853#L16 [54] L16-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_2|) (= v_ULTIMATE.start_main_~x~0_1 (+ v_ULTIMATE.start_main_~x~0_2 (- 1))) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_2|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 861#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 867#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 869#L23 [2020-06-22 03:26:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,715 INFO L82 PathProgramCache]: Analyzing trace with hash 67999, now seen corresponding path program 3 times [2020-06-22 03:26:30,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2127350343, now seen corresponding path program 1 times [2020-06-22 03:26:30,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:26:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:26:30,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:26:30,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 03:26:30,766 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:26:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 03:26:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:26:30,770 INFO L87 Difference]: Start difference. First operand 114 states and 281 transitions. cyclomatic complexity: 169 Second operand 4 states. [2020-06-22 03:26:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:26:30,809 INFO L93 Difference]: Finished difference Result 71 states and 130 transitions. [2020-06-22 03:26:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 03:26:30,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 130 transitions. [2020-06-22 03:26:30,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 03:26:30,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 47 states and 93 transitions. [2020-06-22 03:26:30,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 03:26:30,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 03:26:30,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 93 transitions. [2020-06-22 03:26:30,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:26:30,813 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 93 transitions. [2020-06-22 03:26:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 93 transitions. [2020-06-22 03:26:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2020-06-22 03:26:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 03:26:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 70 transitions. [2020-06-22 03:26:30,816 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 70 transitions. [2020-06-22 03:26:30,816 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 70 transitions. [2020-06-22 03:26:30,816 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 03:26:30,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 70 transitions. [2020-06-22 03:26:30,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 03:26:30,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:26:30,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:26:30,818 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 03:26:30,818 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-06-22 03:26:30,818 INFO L794 eck$LassoCheckResult]: Stem: 1038#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1039#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1028#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 1029#L23 [57] L23-->L23-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 1032#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1033#L15 [2020-06-22 03:26:30,818 INFO L796 eck$LassoCheckResult]: Loop: 1033#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 1035#L16 [54] L16-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_2|) (= v_ULTIMATE.start_main_~x~0_1 (+ v_ULTIMATE.start_main_~x~0_2 (- 1))) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_2|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1036#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1057#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 1031#L16 [40] L16-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~y~0_6 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 1037#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1033#L15 [2020-06-22 03:26:30,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,819 INFO L82 PathProgramCache]: Analyzing trace with hash 65348858, now seen corresponding path program 1 times [2020-06-22 03:26:30,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:30,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:30,837 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 03:26:30,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:26:30,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:26:30,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 03:26:30,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1883717935, now seen corresponding path program 1 times [2020-06-22 03:26:30,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:26:30,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:26:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:26:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:26:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:26:30,895 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:30,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:30,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:30,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:30,895 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:26:30,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:26:30,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:30,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:30,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 03:26:30,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:30,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:30,897 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 03:26:30,903 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 03:26:30,911 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 03:26:30,959 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:30,959 INFO L412 LassoAnalysis]: Checking for nontermination... 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 03:26:30,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:30,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:30,991 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:26:30,992 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 03:26:30,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:26:30,997 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 03:26:31,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:26:31,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:26:31,099 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:26:31,101 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:26:31,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:26:31,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:26:31,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:26:31,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:26:31,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:26:31,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:26:31,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:26:31,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 03:26:31,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:26:31,103 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:26:31,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 03:26:31,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 03:26:31,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 03:26:31,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:26:31,146 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:26:31,146 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 03:26:31,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:31,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:31,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:31,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:31,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:31,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:31,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:31,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:26:31,151 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 03:26:31,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:26:31,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:26:31,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:26:31,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:26:31,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:26:31,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:26:31,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:26:31,156 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:26:31,159 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:26:31,159 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:26:31,159 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:26:31,159 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:26:31,159 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:26:31,159 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 03:26:31,160 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:26:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:26:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:31,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:26:31,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:31,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:31,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:26:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:31,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:31,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:31,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:26:31,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:26:31,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:26:31,248 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 03:26:31,248 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 03:26:31,248 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 70 transitions. cyclomatic complexity: 43 Second operand 5 states. [2020-06-22 03:26:31,278 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 70 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 50 states and 102 transitions. Complement of second has 8 states. [2020-06-22 03:26:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 03:26:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:26:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-06-22 03:26:31,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 03:26:31,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:31,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 03:26:31,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:31,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 12 letters. [2020-06-22 03:26:31,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:26:31,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 102 transitions. [2020-06-22 03:26:31,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:26:31,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. [2020-06-22 03:26:31,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 03:26:31,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 03:26:31,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 03:26:31,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:26:31,285 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:26:31,285 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:26:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 03:26:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:26:31,286 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-06-22 03:26:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:26:31,286 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-06-22 03:26:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 03:26:31,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-06-22 03:26:31,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:26:31,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 03:26:31,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 03:26:31,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 03:26:31,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 03:26:31,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:26:31,288 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:26:31,288 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:26:31,288 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:26:31,288 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 03:26:31,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 03:26:31,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:26:31,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 03:26:31,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:26:31 BasicIcfg [2020-06-22 03:26:31,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 03:26:31,295 INFO L168 Benchmark]: Toolchain (without parser) took 3695.33 ms. Allocated memory was 649.6 MB in the beginning and 747.6 MB in the end (delta: 98.0 MB). Free memory was 563.6 MB in the beginning and 582.0 MB in the end (delta: -18.4 MB). Peak memory consumption was 79.6 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,297 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 591.1 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:26:31,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.40 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 563.6 MB in the beginning and 637.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.07 ms. Allocated memory is still 671.1 MB. Free memory was 637.8 MB in the beginning and 636.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,298 INFO L168 Benchmark]: Boogie Preprocessor took 19.66 ms. Allocated memory is still 671.1 MB. Free memory was 636.7 MB in the beginning and 632.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,299 INFO L168 Benchmark]: RCFGBuilder took 207.18 ms. Allocated memory is still 671.1 MB. Free memory was 632.8 MB in the beginning and 619.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,299 INFO L168 Benchmark]: BlockEncodingV2 took 79.74 ms. Allocated memory is still 671.1 MB. Free memory was 619.4 MB in the beginning and 614.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,300 INFO L168 Benchmark]: TraceAbstraction took 163.42 ms. Allocated memory is still 671.1 MB. Free memory was 612.9 MB in the beginning and 604.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,300 INFO L168 Benchmark]: BuchiAutomizer took 2910.72 ms. Allocated memory was 671.1 MB in the beginning and 747.6 MB in the end (delta: 76.5 MB). Free memory was 604.2 MB in the beginning and 582.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 98.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:26:31,305 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 12 edges - StatisticsResult: Encoded RCFG 5 locations, 11 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 591.1 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 274.40 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 563.6 MB in the beginning and 637.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.07 ms. Allocated memory is still 671.1 MB. Free memory was 637.8 MB in the beginning and 636.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.66 ms. Allocated memory is still 671.1 MB. Free memory was 636.7 MB in the beginning and 632.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. * RCFGBuilder took 207.18 ms. Allocated memory is still 671.1 MB. Free memory was 632.8 MB in the beginning and 619.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 79.74 ms. Allocated memory is still 671.1 MB. Free memory was 619.4 MB in the beginning and 614.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 163.42 ms. Allocated memory is still 671.1 MB. Free memory was 612.9 MB in the beginning and 604.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2910.72 ms. Allocated memory was 671.1 MB in the beginning and 747.6 MB in the end (delta: 76.5 MB). Free memory was 604.2 MB in the beginning and 582.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 98.7 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: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 146 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 114 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 30 SDtfs, 98 SDslu, 29 SDs, 0 SdLazy, 215 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 03:26:24.386 ----------------------------------------------- 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 03:26:31.536 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check