YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 03:07:11,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 03:07:11,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 03:07:11,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 03:07:11,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 03:07:11,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 03:07:11,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 03:07:11,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 03:07:11,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 03:07:11,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 03:07:11,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 03:07:11,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 03:07:11,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 03:07:11,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 03:07:11,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 03:07:11,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 03:07:11,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 03:07:11,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 03:07:11,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 03:07:11,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 03:07:11,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 03:07:11,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 03:07:11,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 03:07:11,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 03:07:11,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 03:07:11,311 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 03:07:11,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 03:07:11,313 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 03:07:11,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 03:07:11,313 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 03:07:11,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 03:07:11,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 03:07:11,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 03:07:11,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 03:07:11,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 03:07:11,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 03:07:11,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 03:07:11,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 03:07:11,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 03:07:11,319 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 03:07:11,334 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 03:07:11,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 03:07:11,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 03:07:11,335 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 03:07:11,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 03:07:11,336 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:07:11,336 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 03:07:11,336 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 03:07:11,336 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 03:07:11,337 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 03:07:11,337 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 03:07:11,337 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 03:07:11,337 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 03:07:11,337 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 03:07:11,338 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:11,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 03:07:11,338 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 03:07:11,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 03:07:11,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 03:07:11,338 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 03:07:11,339 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 03:07:11,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 03:07:11,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 03:07:11,339 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 03:07:11,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:07:11,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 03:07:11,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 03:07:11,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 03:07:11,340 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 03:07:11,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 03:07:11,379 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 03:07:11,382 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 03:07:11,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 03:07:11,384 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 03:07:11,384 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 03:07:11,454 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8d6403a46fad4d0d9fa46ff6918c3539/FLAG004f47fa1 [2020-06-22 03:07:11,791 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 03:07:11,792 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 03:07:11,798 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8d6403a46fad4d0d9fa46ff6918c3539/FLAG004f47fa1 [2020-06-22 03:07:12,204 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8d6403a46fad4d0d9fa46ff6918c3539 [2020-06-22 03:07:12,216 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 03:07:12,217 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 03:07:12,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 03:07:12,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 03:07:12,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 03:07:12,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c05d994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12, skipping insertion in model container [2020-06-22 03:07:12,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 03:07:12,251 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 03:07:12,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:07:12,413 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 03:07:12,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:07:12,509 INFO L195 MainTranslator]: Completed translation [2020-06-22 03:07:12,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12 WrapperNode [2020-06-22 03:07:12,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 03:07:12,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 03:07:12,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 03:07:12,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 03:07:12,521 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:07:12" (1/1) ... [2020-06-22 03:07:12,527 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:07:12" (1/1) ... [2020-06-22 03:07:12,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 03:07:12,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 03:07:12,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 03:07:12,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 03:07:12,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 03:07:12,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 03:07:12,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 03:07:12,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 03:07:12,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (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:07:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure p [2020-06-22 03:07:12,639 INFO L138 BoogieDeclarations]: Found implementation of procedure p [2020-06-22 03:07:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 03:07:12,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 03:07:12,799 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 03:07:12,800 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 03:07:12,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:07:12 BoogieIcfgContainer [2020-06-22 03:07:12,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 03:07:12,802 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 03:07:12,802 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 03:07:12,804 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 03:07:12,805 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:07:12" (1/1) ... [2020-06-22 03:07:12,822 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 21 edges [2020-06-22 03:07:12,824 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 03:07:12,825 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 03:07:12,825 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 03:07:12,826 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:07:12,827 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 03:07:12,829 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 03:07:12,829 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 03:07:12,845 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 03:07:12,859 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 03:07:12,864 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:07:12,867 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:07:12,877 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 03:07:12,879 INFO L70 RemoveSinkStates]: Removed 6 edges and 3 locations by removing sink states [2020-06-22 03:07:12,881 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:07:12,881 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:07:12,887 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 03:07:12,888 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:07:12,889 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:07:12,889 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:07:12,889 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 03:07:12,890 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:07:12,890 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 14 edges [2020-06-22 03:07:12,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:07:12 BasicIcfg [2020-06-22 03:07:12,891 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 03:07:12,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 03:07:12,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 03:07:12,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 03:07:12,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 03:07:12" (1/4) ... [2020-06-22 03:07:12,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446680bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:07:12, skipping insertion in model container [2020-06-22 03:07:12,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (2/4) ... [2020-06-22 03:07:12,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446680bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:07:12, skipping insertion in model container [2020-06-22 03:07:12,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:07:12" (3/4) ... [2020-06-22 03:07:12,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446680bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:07:12, skipping insertion in model container [2020-06-22 03:07:12,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:07:12" (4/4) ... [2020-06-22 03:07:12,900 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:07:12,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 03:07:12,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 03:07:12,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 03:07:12,963 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:07:12,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 03:07:12,964 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 03:07:12,964 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:07:12,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:07:12,965 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:07:12,965 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 03:07:12,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:07:12,965 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 03:07:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-06-22 03:07:12,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 03:07:12,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-06-22 03:07:13,051 INFO L451 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: true [2020-06-22 03:07:13,051 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-06-22 03:07:13,051 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 03:07:13,052 INFO L451 ceAbstractionStarter]: At program point pENTRY(lines 12 22) the Hoare annotation is: true [2020-06-22 03:07:13,052 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true [2020-06-22 03:07:13,052 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. [2020-06-22 03:07:13,052 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 03:07:13,052 INFO L448 ceAbstractionStarter]: For program point pFINAL(lines 12 22) no Hoare annotation was computed. [2020-06-22 03:07:13,052 INFO L448 ceAbstractionStarter]: For program point pEXIT(lines 12 22) no Hoare annotation was computed. [2020-06-22 03:07:13,053 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 03:07:13,053 INFO L451 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: true [2020-06-22 03:07:13,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:07:13 BasicIcfg [2020-06-22 03:07:13,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 03:07:13,057 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 03:07:13,057 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 03:07:13,061 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 03:07:13,061 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:07:13,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 03:07:12" (1/5) ... [2020-06-22 03:07:13,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55790cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:07:13, skipping insertion in model container [2020-06-22 03:07:13,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:07:13,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:07:12" (2/5) ... [2020-06-22 03:07:13,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55790cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:07:13, skipping insertion in model container [2020-06-22 03:07:13,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:07:13,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:07:12" (3/5) ... [2020-06-22 03:07:13,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55790cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:07:13, skipping insertion in model container [2020-06-22 03:07:13,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:07:13,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:07:12" (4/5) ... [2020-06-22 03:07:13,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55790cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:07:13, skipping insertion in model container [2020-06-22 03:07:13,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:07:13,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:07:13" (5/5) ... [2020-06-22 03:07:13,066 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:07:13,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:07:13,096 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 03:07:13,096 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 03:07:13,096 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:07:13,096 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:07:13,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:07:13,096 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 03:07:13,096 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:07:13,097 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 03:07:13,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 03:07:13,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 03:07:13,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:07:13,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:07:13,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:07:13,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:07:13,129 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 03:07:13,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-22 03:07:13,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 03:07:13,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:07:13,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:07:13,131 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 03:07:13,131 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:07:13,137 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 9#L29true [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10#pENTRYtrue [2020-06-22 03:07:13,138 INFO L796 eck$LassoCheckResult]: Loop: 10#pENTRYtrue [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 11#L13true [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 8#L14true [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10#pENTRYtrue [2020-06-22 03:07:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2958, now seen corresponding path program 1 times [2020-06-22 03:07:13,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:13,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:13,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:13,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 72551, now seen corresponding path program 1 times [2020-06-22 03:07:13,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash 88164538, now seen corresponding path program 1 times [2020-06-22 03:07:13,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:13,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:13,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:13,367 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:13,368 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:13,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:13,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:13,369 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:07:13,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:13,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:13,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 03:07:13,370 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:13,370 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:13,389 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:07:13,396 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:07:13,399 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:07:13,402 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:07:13,406 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:07:13,409 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:07:13,411 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:07:13,421 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:07:13,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:13,504 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:07:13,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,522 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:13,523 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:13,560 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:13,591 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,623 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:13,623 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=0} Honda state: {p_#in~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,651 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:13,655 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~n=0} Honda state: {p_~n=0} 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:07:13,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,682 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,685 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:13,685 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~m=0} Honda state: {p_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:13,712 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:13,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:07:13,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:13,859 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:07:13,862 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:13,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:13,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:13,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:13,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:07:13,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:07:13,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:13,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:13,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 03:07:13,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:13,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:13,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:13,868 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:07:13,870 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:07:13,872 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:07:13,874 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:07:13,878 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:07:13,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:13,889 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:07:13,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:13,967 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:07:13,968 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:07:13,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:13,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:13,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:13,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:13,979 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:07:13,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:13,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:13,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:13,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:13,983 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:07:13,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:13,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:13,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:13,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:13,987 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:07:13,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:13,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:13,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:13,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:13,990 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:07:13,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:13,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:13,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:13,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:13,994 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:07:13,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:13,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:13,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:13,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:13,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 03:07:13,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:13,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:13,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:13,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:13,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:14,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:14,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,008 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:07:14,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:14,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:14,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,011 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 03:07:14,012 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:07:14,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,014 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,015 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:07:14,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,017 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,017 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,020 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:07:14,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,022 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,024 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:07:14,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,026 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,027 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:07:14,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,029 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,029 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,032 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:07:14,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,033 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,033 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:14,035 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:07:14,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:14,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:14,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:14,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:14,036 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:14,038 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:14,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:14,050 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:07:14,065 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 03:07:14,065 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 03:07:14,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:07:14,067 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:07:14,068 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:07:14,068 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_#in~n + 1*p_#in~r f1 = 1*p_#in~r Supporting invariants [] [2020-06-22 03:07:14,070 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:07:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:14,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:07:14,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:14,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:07:14,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:14,257 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:07:14,573 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization [2020-06-22 03:07:14,578 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2020-06-22 03:07:14,580 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. [2020-06-22 03:07:15,028 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 118 states and 158 transitions. Complement of second has 31 states. [2020-06-22 03:07:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 03:07:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:07:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-06-22 03:07:15,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 03:07:15,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:15,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 03:07:15,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:15,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 03:07:15,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:15,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 158 transitions. [2020-06-22 03:07:15,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 03:07:15,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 29 states and 34 transitions. [2020-06-22 03:07:15,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 03:07:15,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 03:07:15,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2020-06-22 03:07:15,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:07:15,064 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-06-22 03:07:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2020-06-22 03:07:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 12. [2020-06-22 03:07:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 03:07:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-06-22 03:07:15,095 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-06-22 03:07:15,096 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-06-22 03:07:15,096 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 03:07:15,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-06-22 03:07:15,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 03:07:15,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:07:15,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:07:15,097 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:07:15,097 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:07:15,098 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 217#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 227#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 226#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 221#L16 [2020-06-22 03:07:15,098 INFO L796 eck$LassoCheckResult]: Loop: 221#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 216#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 218#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 224#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 221#L16 [2020-06-22 03:07:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2844027, now seen corresponding path program 1 times [2020-06-22 03:07:15,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2030060, now seen corresponding path program 1 times [2020-06-22 03:07:15,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:15,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:15,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:15,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219546, now seen corresponding path program 1 times [2020-06-22 03:07:15,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:15,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:15,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:15,219 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:15,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:15,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:15,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:15,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:07:15,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:15,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:15,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:15,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 03:07:15,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:15,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:15,222 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:07:15,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:07:15,226 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:07:15,228 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:07:15,234 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:07:15,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:15,297 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:15,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:15,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:15,305 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:15,305 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} 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:07:15,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:15,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:15,335 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:15,335 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:15,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:15,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:15,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:15,365 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:07:15,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:15,391 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:07:15,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:07:15,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:15,901 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:07:15,904 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:15,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:15,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:15,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:15,904 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:07:15,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:07:15,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:15,905 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:15,905 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 03:07:15,905 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:15,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:15,906 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:07:15,908 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:07:15,910 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:07:15,916 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:07:15,918 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:07:15,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:15,979 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:07:15,980 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:07:15,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:15,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:15,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:15,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:15,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:15,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:15,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:15,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:15,983 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:07:15,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:15,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:15,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:15,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:15,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:15,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:15,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:15,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:15,986 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:07:15,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:15,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:15,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:15,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:15,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:15,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:15,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:15,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:07:15,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 03:07:15,995 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:07:15,996 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:07:15,996 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:07:15,996 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:07:15,996 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_~n) = 1*p_~n Supporting invariants [] [2020-06-22 03:07:15,997 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:07:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:16,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:07:16,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:16,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:07:16,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:16,079 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:07:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,122 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 03:07:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:16,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 03:07:16,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:16,139 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 03:07:16,140 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 03:07:16,140 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-06-22 03:07:16,171 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 44 states and 57 transitions. Complement of second has 36 states. [2020-06-22 03:07:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 03:07:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:07:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-06-22 03:07:16,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 03:07:16,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:16,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 03:07:16,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:16,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 03:07:16,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:16,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2020-06-22 03:07:16,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 03:07:16,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2020-06-22 03:07:16,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 03:07:16,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 03:07:16,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-06-22 03:07:16,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:07:16,180 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-06-22 03:07:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-06-22 03:07:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-06-22 03:07:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 03:07:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-06-22 03:07:16,182 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 03:07:16,183 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 03:07:16,183 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 03:07:16,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-06-22 03:07:16,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 03:07:16,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:07:16,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:07:16,184 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:07:16,184 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2020-06-22 03:07:16,184 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 366#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 377#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 378#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 370#L16 [2020-06-22 03:07:16,184 INFO L796 eck$LassoCheckResult]: Loop: 370#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 365#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 369#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 376#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 367#L14 [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 373#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 375#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 370#L16 [2020-06-22 03:07:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2844027, now seen corresponding path program 2 times [2020-06-22 03:07:16,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:16,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:16,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash 347689366, now seen corresponding path program 1 times [2020-06-22 03:07:16,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:16,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:16,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:07:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash -164516132, now seen corresponding path program 1 times [2020-06-22 03:07:16,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:16,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:16,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:16,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:16,368 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:16,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:16,369 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:16,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:16,369 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:07:16,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:16,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:16,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:16,370 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 03:07:16,370 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:16,370 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:16,371 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:07:16,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:16,389 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:07:16,390 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:07:16,467 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:16,467 INFO L412 LassoAnalysis]: Checking for nontermination... 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:07:16,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:16,471 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:16,474 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:16,474 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:16,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:16,500 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:16,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:07:16,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:22,089 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:07:22,094 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:22,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:22,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:22,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:22,094 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:07:22,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:07:22,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:22,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:22,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 03:07:22,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:22,095 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:22,096 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:07:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:22,127 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:07:22,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:22,212 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:22,213 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:07:22,213 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:07:22,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:22,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:22,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:22,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:22,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:22,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:22,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:22,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:22,224 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:07:22,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:22,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:22,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:22,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:22,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:22,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:22,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:22,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:22,227 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:07:22,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:22,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:22,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:22,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:22,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:22,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:22,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:22,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:22,230 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:07:22,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:22,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:22,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:22,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:22,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:22,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:22,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:22,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:22,232 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 03:07:22,232 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:07:22,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:22,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:22,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:22,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:22,233 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:22,235 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:22,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:22,249 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:07:22,272 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 03:07:22,272 INFO L444 ModelExtractionUtils]: 7 out of 15 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 03:07:22,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:07:22,272 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:07:22,273 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:07:22,273 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~m + 1*p_~r f1 = 1*p_~m Supporting invariants [] [2020-06-22 03:07:22,273 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:07:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:22,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:07:22,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:22,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 03:07:22,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:07:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:23,124 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 03:07:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:23,143 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 03:07:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:23,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 03:07:23,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:24,576 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 03:07:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:24,590 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 03:07:24,591 INFO L98 LoopCannibalizer]: 25 predicates before loop cannibalization 54 predicates after loop cannibalization [2020-06-22 03:07:24,591 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 54 loop predicates [2020-06-22 03:07:24,591 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-06-22 03:07:25,160 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2020-06-22 03:07:25,558 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 29 [2020-06-22 03:07:26,050 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 28 [2020-06-22 03:07:26,871 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 28 [2020-06-22 03:07:27,634 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 28 [2020-06-22 03:07:27,878 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2020-06-22 03:07:28,313 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2020-06-22 03:07:28,719 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 25 [2020-06-22 03:07:29,022 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2020-06-22 03:07:29,497 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2020-06-22 03:07:29,727 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 29 [2020-06-22 03:07:29,983 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2020-06-22 03:07:30,206 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2020-06-22 03:07:31,343 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2020-06-22 03:07:31,565 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 30 [2020-06-22 03:07:31,867 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2020-06-22 03:07:32,120 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2020-06-22 03:07:32,989 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2020-06-22 03:07:33,707 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 5242 states and 7057 transitions. Complement of second has 4392 states. [2020-06-22 03:07:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 43 states 1 stem states 39 non-accepting loop states 3 accepting loop states [2020-06-22 03:07:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 03:07:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2020-06-22 03:07:33,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 75 transitions. Stem has 4 letters. Loop has 7 letters. [2020-06-22 03:07:33,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:33,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 75 transitions. Stem has 11 letters. Loop has 7 letters. [2020-06-22 03:07:33,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:33,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 75 transitions. Stem has 4 letters. Loop has 14 letters. [2020-06-22 03:07:33,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:33,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5242 states and 7057 transitions. [2020-06-22 03:07:33,792 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2020-06-22 03:07:33,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5242 states to 643 states and 792 transitions. [2020-06-22 03:07:33,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2020-06-22 03:07:33,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2020-06-22 03:07:33,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 643 states and 792 transitions. [2020-06-22 03:07:33,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:07:33,804 INFO L706 BuchiCegarLoop]: Abstraction has 643 states and 792 transitions. [2020-06-22 03:07:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states and 792 transitions. [2020-06-22 03:07:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 89. [2020-06-22 03:07:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-06-22 03:07:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2020-06-22 03:07:33,820 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 116 transitions. [2020-06-22 03:07:33,820 INFO L609 BuchiCegarLoop]: Abstraction has 89 states and 116 transitions. [2020-06-22 03:07:33,820 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 03:07:33,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 116 transitions. [2020-06-22 03:07:33,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2020-06-22 03:07:33,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:07:33,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:07:33,822 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 03:07:33,822 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 03:07:33,822 INFO L794 eck$LassoCheckResult]: Stem: 10252#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 10248#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10263#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 10265#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 10247#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 10250#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10286#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 10287#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 10258#L14 [2020-06-22 03:07:33,823 INFO L796 eck$LassoCheckResult]: Loop: 10258#L14 [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10237#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 10259#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 10258#L14 [2020-06-22 03:07:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219557, now seen corresponding path program 1 times [2020-06-22 03:07:33,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:33,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:33,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:33,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:33,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:33,836 INFO L82 PathProgramCache]: Analyzing trace with hash 71531, now seen corresponding path program 2 times [2020-06-22 03:07:33,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:07:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:33,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash -164516143, now seen corresponding path program 2 times [2020-06-22 03:07:33,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:33,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:33,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:07:33,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:33,928 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:33,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:33,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:33,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:33,928 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:07:33,928 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:33,928 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:33,928 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:33,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 03:07:33,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:33,929 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:33,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:33,932 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:07:33,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:33,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:33,947 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:07:33,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:33,998 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:34,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:34,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:34,009 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:34,010 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:34,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:34,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:34,044 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:07:34,044 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=1, p_~m=1} Honda state: {p_#in~m=1, p_~m=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:34,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:07:34,072 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:07:34,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:07:34,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:07:46,139 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 03:07:46,143 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:07:46,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:07:46,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:07:46,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:07:46,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:07:46,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:07:46,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:07:46,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:07:46,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 03:07:46,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:07:46,145 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:07:46,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:07:46,148 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:07:46,152 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:07:46,161 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:07:46,162 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:07:46,208 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:07:46,209 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:07:46,209 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:07:46,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:46,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:46,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,212 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:07:46,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:46,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:46,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,215 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:07:46,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:46,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:46,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,221 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:07:46,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:46,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:46,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,224 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:07:46,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:07:46,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:07:46,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,226 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 03:07:46,226 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:07:46,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,227 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:46,227 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:46,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,228 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:07:46,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,229 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:46,230 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:46,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:07:46,231 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:07:46,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:07:46,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:07:46,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:07:46,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:07:46,232 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 03:07:46,233 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 03:07:46,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:07:46,240 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:07:46,244 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 03:07:46,245 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 03:07:46,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:07:46,245 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:07:46,245 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:07:46,245 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~r + 1*p_~n f1 = 1*p_~n Supporting invariants [] [2020-06-22 03:07:46,246 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:07:46,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:46,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:07:46,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:46,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:07:46,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:46,354 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:07:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:07:46,666 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 03:07:46,666 INFO L98 LoopCannibalizer]: 18 predicates before loop cannibalization 18 predicates after loop cannibalization [2020-06-22 03:07:46,667 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 18 loop predicates [2020-06-22 03:07:46,667 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 89 states and 116 transitions. cyclomatic complexity: 33 Second operand 4 states. [2020-06-22 03:07:46,934 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 89 states and 116 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 1858 states and 2659 transitions. Complement of second has 93 states. [2020-06-22 03:07:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 03:07:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:07:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-06-22 03:07:46,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 3 letters. [2020-06-22 03:07:46,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:46,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2020-06-22 03:07:46,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:46,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 6 letters. [2020-06-22 03:07:46,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:07:46,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2659 transitions. [2020-06-22 03:07:46,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-06-22 03:07:46,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 298 states and 378 transitions. [2020-06-22 03:07:46,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 03:07:46,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 03:07:46,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 378 transitions. [2020-06-22 03:07:46,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:07:46,960 INFO L706 BuchiCegarLoop]: Abstraction has 298 states and 378 transitions. [2020-06-22 03:07:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 378 transitions. [2020-06-22 03:07:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 81. [2020-06-22 03:07:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-06-22 03:07:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2020-06-22 03:07:46,966 INFO L729 BuchiCegarLoop]: Abstraction has 81 states and 106 transitions. [2020-06-22 03:07:46,967 INFO L609 BuchiCegarLoop]: Abstraction has 81 states and 106 transitions. [2020-06-22 03:07:46,967 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 03:07:46,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 106 transitions. [2020-06-22 03:07:46,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 03:07:46,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:07:46,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:07:46,968 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1] [2020-06-22 03:07:46,968 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1] [2020-06-22 03:07:46,969 INFO L794 eck$LassoCheckResult]: Stem: 12363#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 12356#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12368#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12372#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12352#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12355#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12402#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12399#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12384#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12360#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12371#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12370#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 12359#L14 [2020-06-22 03:07:46,969 INFO L796 eck$LassoCheckResult]: Loop: 12359#L14 [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12365#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12414#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12357#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12355#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12402#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12399#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12384#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12360#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12371#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12370#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 12359#L14 [2020-06-22 03:07:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash -795061818, now seen corresponding path program 2 times [2020-06-22 03:07:46,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:46,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:07:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:07:47,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:07:47,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:07:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 03:07:47,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 03:07:47,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:07:47,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:07:47,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:07:47,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:07:47,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 03:07:47,091 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 03:07:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:07:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -615917375, now seen corresponding path program 2 times [2020-06-22 03:07:47,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:07:47,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:07:47,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:47,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:07:47,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:07:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:07:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:07:47,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:07:47,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:07:47,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 03:07:47,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 03:07:47,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:07:47,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:07:47,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:07:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:07:47,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:07:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 03:07:47,197 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:07:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 03:07:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 03:07:47,203 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. cyclomatic complexity: 29 Second operand 6 states. [2020-06-22 03:07:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:07:47,270 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-06-22 03:07:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 03:07:47,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2020-06-22 03:07:47,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:07:47,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2020-06-22 03:07:47,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 03:07:47,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 03:07:47,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 03:07:47,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:07:47,274 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:07:47,274 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:07:47,274 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:07:47,274 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 03:07:47,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 03:07:47,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:07:47,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 03:07:47,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:07:47 BasicIcfg [2020-06-22 03:07:47,281 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 03:07:47,281 INFO L168 Benchmark]: Toolchain (without parser) took 35064.96 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 393.7 MB). Free memory was 565.3 MB in the beginning and 756.9 MB in the end (delta: -191.6 MB). Peak memory consumption was 202.1 MB. Max. memory is 50.3 GB. [2020-06-22 03:07:47,282 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:07:47,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.78 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 565.3 MB in the beginning and 649.3 MB in the end (delta: -84.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-06-22 03:07:47,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 682.6 MB. Free memory was 649.3 MB in the beginning and 646.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:07:47,283 INFO L168 Benchmark]: Boogie Preprocessor took 18.12 ms. Allocated memory is still 682.6 MB. Free memory is still 646.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:07:47,284 INFO L168 Benchmark]: RCFGBuilder took 235.13 ms. Allocated memory is still 682.6 MB. Free memory was 645.2 MB in the beginning and 629.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 50.3 GB. [2020-06-22 03:07:47,284 INFO L168 Benchmark]: BlockEncodingV2 took 89.34 ms. Allocated memory is still 682.6 MB. Free memory was 629.1 MB in the beginning and 623.7 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:07:47,285 INFO L168 Benchmark]: TraceAbstraction took 164.49 ms. Allocated memory is still 682.6 MB. Free memory was 623.7 MB in the beginning and 612.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. [2020-06-22 03:07:47,285 INFO L168 Benchmark]: BuchiAutomizer took 34223.79 ms. Allocated memory was 682.6 MB in the beginning and 1.0 GB in the end (delta: 360.7 MB). Free memory was 612.8 MB in the beginning and 756.9 MB in the end (delta: -144.1 MB). Peak memory consumption was 216.6 MB. Max. memory is 50.3 GB. [2020-06-22 03:07:47,290 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 21 edges - StatisticsResult: Encoded RCFG 11 locations, 14 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 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 291.78 ms. Allocated memory was 649.6 MB in the beginning and 682.6 MB in the end (delta: 33.0 MB). Free memory was 565.3 MB in the beginning and 649.3 MB in the end (delta: -84.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 682.6 MB. Free memory was 649.3 MB in the beginning and 646.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.12 ms. Allocated memory is still 682.6 MB. Free memory is still 646.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * RCFGBuilder took 235.13 ms. Allocated memory is still 682.6 MB. Free memory was 645.2 MB in the beginning and 629.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 89.34 ms. Allocated memory is still 682.6 MB. Free memory was 629.1 MB in the beginning and 623.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 164.49 ms. Allocated memory is still 682.6 MB. Free memory was 623.7 MB in the beginning and 612.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 34223.79 ms. Allocated memory was 682.6 MB in the beginning and 1.0 GB in the end (delta: 360.7 MB). Free memory was 612.8 MB in the beginning and 756.9 MB in the end (delta: -144.1 MB). Peak memory consumption was 216.6 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 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=11occurred 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, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has 2-nested ranking function (if \old(n) + \old(r) > 0 then 1 else 0), (if \old(n) + \old(r) > 0 then \old(n) + \old(r) else \old(r)) and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has 2-nested ranking function (if m + r > 0 then 1 else 0), (if m + r > 0 then m + r else m) and consists of 43 locations. One nondeterministic module has 2-nested ranking function (if r + n > 0 then 1 else 0), (if r + n > 0 then r + n else n) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.1s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 20.5s. Construction of modules took 0.8s. Büchi inclusion checks took 12.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 795 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 89 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 86 SDtfs, 506 SDslu, 285 SDs, 0 SdLazy, 1035 SolverSat, 247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp96 dnf100 smp100 tf106 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 18.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 03:07:08.971 ----------------------------------------------- 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:07:47.521 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check