MAYBE Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:25:37,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:25:37,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:25:37,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:25:37,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:25:37,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:25:37,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:25:37,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:25:37,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:25:37,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:25:37,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:25:37,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:25:37,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:25:37,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:25:37,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:25:37,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:25:37,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:25:37,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:25:37,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:25:37,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:25:37,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:25:37,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:25:37,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:25:37,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:25:37,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:25:37,419 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:25:37,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:25:37,420 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:25:37,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:25:37,421 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:25:37,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:25:37,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:25:37,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:25:37,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:25:37,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:25:37,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:25:37,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:25:37,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:25:37,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:25:37,426 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:25:37,441 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:25:37,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:25:37,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:25:37,443 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:25:37,443 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:25:37,443 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:25:37,443 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:25:37,443 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:25:37,443 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:25:37,444 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:25:37,444 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:25:37,444 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:25:37,444 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:25:37,444 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:25:37,444 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:25:37,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:25:37,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:25:37,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:25:37,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:25:37,445 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:25:37,445 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:25:37,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:25:37,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:25:37,446 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:25:37,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:25:37,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:25:37,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:25:37,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:25:37,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:25:37,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:25:37,485 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:25:37,488 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:25:37,490 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:25:37,490 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:25:37,491 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:25:37,555 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/634f078906694f15acf40b23d588c29c/FLAG986e45d48 [2020-06-22 09:25:37,885 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:25:37,886 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:25:37,886 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:25:37,893 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/634f078906694f15acf40b23d588c29c/FLAG986e45d48 [2020-06-22 09:25:38,311 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/634f078906694f15acf40b23d588c29c [2020-06-22 09:25:38,323 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:25:38,325 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:25:38,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:25:38,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:25:38,329 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:25:38,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3779879b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38, skipping insertion in model container [2020-06-22 09:25:38,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:25:38,359 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:25:38,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:25:38,538 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:25:38,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:25:38,646 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:25:38,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38 WrapperNode [2020-06-22 09:25:38,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:25:38,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:25:38,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:25:38,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:25:38,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:25:38,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:25:38,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:25:38,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:25:38,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... [2020-06-22 09:25:38,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:25:38,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:25:38,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:25:38,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:25:38,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 09:25:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:25:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:25:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:25:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:25:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:25:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:25:39,078 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:25:39,078 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:25:39,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:39 BoogieIcfgContainer [2020-06-22 09:25:39,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:25:39,080 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:25:39,081 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:25:39,083 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:25:39,083 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:39" (1/1) ... [2020-06-22 09:25:39,099 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 34 edges [2020-06-22 09:25:39,101 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:25:39,102 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:25:39,102 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:25:39,102 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:25:39,104 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:25:39,105 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:25:39,105 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:25:39,130 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:25:39,164 INFO L200 BlockEncoder]: SBE split 14 edges [2020-06-22 09:25:39,169 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:25:39,171 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:25:39,194 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 09:25:39,196 INFO L70 RemoveSinkStates]: Removed 7 edges and 3 locations by removing sink states [2020-06-22 09:25:39,198 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:25:39,198 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:25:39,198 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:25:39,199 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:25:39,199 INFO L313 BlockEncoder]: Encoded RCFG 22 locations, 39 edges [2020-06-22 09:25:39,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:25:39 BasicIcfg [2020-06-22 09:25:39,200 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:25:39,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:25:39,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:25:39,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:25:39,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:25:38" (1/4) ... [2020-06-22 09:25:39,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70288a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:25:39, skipping insertion in model container [2020-06-22 09:25:39,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (2/4) ... [2020-06-22 09:25:39,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70288a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:25:39, skipping insertion in model container [2020-06-22 09:25:39,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:39" (3/4) ... [2020-06-22 09:25:39,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70288a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:25:39, skipping insertion in model container [2020-06-22 09:25:39,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:25:39" (4/4) ... [2020-06-22 09:25:39,208 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:25:39,218 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:25:39,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2020-06-22 09:25:39,244 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-06-22 09:25:39,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:25:39,273 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:25:39,273 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:25:39,273 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:25:39,273 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:25:39,274 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:25:39,274 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:25:39,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:25:39,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:25:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-06-22 09:25:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:25:39,295 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:39,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:39,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 159981130, now seen corresponding path program 1 times [2020-06-22 09:25:39,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:39,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:39,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:39,485 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 09:25:39,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:39,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:25:39,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:25:39,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:25:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:39,508 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-06-22 09:25:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:39,608 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2020-06-22 09:25:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:25:39,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:25:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:39,623 INFO L225 Difference]: With dead ends: 22 [2020-06-22 09:25:39,623 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 09:25:39,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 09:25:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 09:25:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:25:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2020-06-22 09:25:39,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 [2020-06-22 09:25:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:39,666 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-06-22 09:25:39,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:25:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. [2020-06-22 09:25:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:25:39,666 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:39,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:39,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 159981132, now seen corresponding path program 1 times [2020-06-22 09:25:39,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:39,715 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 09:25:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:39,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:25:39,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:25:39,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:25:39,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:39,718 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 3 states. [2020-06-22 09:25:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:39,807 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2020-06-22 09:25:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:25:39,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:25:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:39,809 INFO L225 Difference]: With dead ends: 22 [2020-06-22 09:25:39,809 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 09:25:39,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 09:25:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 09:25:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:25:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-06-22 09:25:39,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 5 [2020-06-22 09:25:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:39,815 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-06-22 09:25:39,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:25:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-06-22 09:25:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:25:39,815 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:39,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:39,816 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 159981133, now seen corresponding path program 1 times [2020-06-22 09:25:39,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:39,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:39,878 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 09:25:39,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:39,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:25:39,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:25:39,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:25:39,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:39,880 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. [2020-06-22 09:25:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:39,939 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 09:25:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:39,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:25:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:39,940 INFO L225 Difference]: With dead ends: 21 [2020-06-22 09:25:39,940 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:25:39,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:25:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:25:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:25:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 09:25:39,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 [2020-06-22 09:25:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:39,945 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 09:25:39,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:25:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-06-22 09:25:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:25:39,946 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:39,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:25:39,947 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash 664446269, now seen corresponding path program 1 times [2020-06-22 09:25:39,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:39,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:39,977 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 09:25:39,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:39,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:25:39,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:25:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:25:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:39,979 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 3 states. [2020-06-22 09:25:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,038 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-06-22 09:25:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:25:40,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:25:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,039 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:25:40,040 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:25:40,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:25:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:25:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:25:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-06-22 09:25:40,044 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-06-22 09:25:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,044 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-06-22 09:25:40,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:25:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-06-22 09:25:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:25:40,045 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 664446271, now seen corresponding path program 1 times [2020-06-22 09:25:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,089 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 09:25:40,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:25:40,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:25:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:25:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:40,091 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 3 states. [2020-06-22 09:25:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,143 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-06-22 09:25:40,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:25:40,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:25:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,144 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:25:40,145 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:25:40,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:25:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:25:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:25:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-06-22 09:25:40,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 6 [2020-06-22 09:25:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,149 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-06-22 09:25:40,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:25:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-06-22 09:25:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:25:40,150 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,150 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 664446272, now seen corresponding path program 1 times [2020-06-22 09:25:40,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,182 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 09:25:40,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:25:40,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:25:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:25:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:40,183 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 4 states. [2020-06-22 09:25:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,226 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. [2020-06-22 09:25:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:40,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 09:25:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,228 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:25:40,228 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:25:40,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:25:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:25:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:25:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2020-06-22 09:25:40,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 6 [2020-06-22 09:25:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,232 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. [2020-06-22 09:25:40,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:25:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2020-06-22 09:25:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:25:40,233 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,233 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236218, now seen corresponding path program 1 times [2020-06-22 09:25:40,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,288 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 09:25:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:40,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:25:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:40,289 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 5 states. [2020-06-22 09:25:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,396 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2020-06-22 09:25:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:25:40,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 09:25:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,397 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:25:40,398 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:25:40,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:25:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:25:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:25:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:25:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-06-22 09:25:40,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 8 [2020-06-22 09:25:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,402 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 09:25:40,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:25:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 29 transitions. [2020-06-22 09:25:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:25:40,403 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,403 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236216, now seen corresponding path program 1 times [2020-06-22 09:25:40,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,458 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 09:25:40,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:40,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:25:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:40,459 INFO L87 Difference]: Start difference. First operand 17 states and 29 transitions. Second operand 5 states. [2020-06-22 09:25:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,556 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-06-22 09:25:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:25:40,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 09:25:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,557 INFO L225 Difference]: With dead ends: 21 [2020-06-22 09:25:40,557 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:25:40,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:25:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:25:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 09:25:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:25:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-06-22 09:25:40,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 8 [2020-06-22 09:25:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,562 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-06-22 09:25:40,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:25:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-06-22 09:25:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:25:40,563 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,563 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1417236215, now seen corresponding path program 1 times [2020-06-22 09:25:40,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,642 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 09:25:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:25:40,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:25:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:25:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:25:40,644 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 7 states. [2020-06-22 09:25:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,752 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2020-06-22 09:25:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:25:40,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 09:25:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,754 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:25:40,754 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:25:40,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:25:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:25:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:25:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:25:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-06-22 09:25:40,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 [2020-06-22 09:25:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,758 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-06-22 09:25:40,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:25:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-06-22 09:25:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:40,759 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,760 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -459349044, now seen corresponding path program 1 times [2020-06-22 09:25:40,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,800 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 09:25:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:25:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:40,801 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. [2020-06-22 09:25:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:40,881 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-06-22 09:25:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:25:40,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 09:25:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:40,883 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:25:40,883 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:25:40,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:25:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:25:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:25:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:25:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-06-22 09:25:40,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 10 [2020-06-22 09:25:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:40,887 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 09:25:40,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:25:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-06-22 09:25:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:40,888 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:40,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:40,888 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash -459349042, now seen corresponding path program 1 times [2020-06-22 09:25:40,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:40,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:40,933 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 09:25:40,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:40,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:25:40,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:25:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:25:40,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:25:40,935 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 6 states. [2020-06-22 09:25:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:41,028 INFO L93 Difference]: Finished difference Result 23 states and 36 transitions. [2020-06-22 09:25:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:25:41,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 09:25:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:41,030 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:25:41,030 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:25:41,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:25:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:25:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-06-22 09:25:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:25:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-06-22 09:25:41,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 10 [2020-06-22 09:25:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:41,034 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-06-22 09:25:41,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:25:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2020-06-22 09:25:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:41,035 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:41,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:41,035 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash -459349041, now seen corresponding path program 1 times [2020-06-22 09:25:41,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:41,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:41,105 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 09:25:41,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:41,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:25:41,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:25:41,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:25:41,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:25:41,106 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 7 states. [2020-06-22 09:25:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:41,234 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2020-06-22 09:25:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:25:41,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-06-22 09:25:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:41,235 INFO L225 Difference]: With dead ends: 22 [2020-06-22 09:25:41,235 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 09:25:41,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 09:25:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 09:25:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-06-22 09:25:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:25:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 09:25:41,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2020-06-22 09:25:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:41,239 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 09:25:41,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:25:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2020-06-22 09:25:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:25:41,240 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:41,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:41,241 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:41,241 INFO L82 PathProgramCache]: Analyzing trace with hash 947221102, now seen corresponding path program 1 times [2020-06-22 09:25:41,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:41,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:41,270 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 09:25:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:41,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:25:41,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:25:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:25:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:41,271 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2020-06-22 09:25:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:41,301 INFO L93 Difference]: Finished difference Result 21 states and 31 transitions. [2020-06-22 09:25:41,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:25:41,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 09:25:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:41,302 INFO L225 Difference]: With dead ends: 21 [2020-06-22 09:25:41,302 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:25:41,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:25:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:25:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:25:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 09:25:41,306 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 12 [2020-06-22 09:25:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:41,306 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 09:25:41,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:25:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2020-06-22 09:25:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:25:41,307 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:41,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:41,307 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:41,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:41,308 INFO L82 PathProgramCache]: Analyzing trace with hash 947221103, now seen corresponding path program 1 times [2020-06-22 09:25:41,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:41,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:41,337 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 09:25:41,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:41,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:25:41,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:25:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:25:41,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:41,339 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 3 states. [2020-06-22 09:25:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:41,368 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 09:25:41,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:25:41,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 09:25:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:41,369 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:25:41,369 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:25:41,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:25:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:25:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:25:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:25:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 09:25:41,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 12 [2020-06-22 09:25:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:41,373 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:25:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:25:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-06-22 09:25:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:25:41,374 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:41,374 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:41,375 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash -251983389, now seen corresponding path program 1 times [2020-06-22 09:25:41,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:41,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:41,443 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 09:25:41,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:41,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:41,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:25:41,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:41,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:41,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:25:41,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:25:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:25:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:25:41,560 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 8 states. [2020-06-22 09:25:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:41,686 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-06-22 09:25:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:25:41,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-06-22 09:25:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:41,687 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:25:41,687 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:25:41,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:25:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:25:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:25:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:25:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-06-22 09:25:41,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 14 [2020-06-22 09:25:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:41,691 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-06-22 09:25:41,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:25:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-06-22 09:25:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:25:41,692 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:41,692 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:41,692 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash -251983388, now seen corresponding path program 1 times [2020-06-22 09:25:41,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:41,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-06-22 09:25:41,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-06-22 09:25:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 09:25:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-06-22 09:25:41,844 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 10 states. [2020-06-22 09:25:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:42,109 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2020-06-22 09:25:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:25:42,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-06-22 09:25:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:42,110 INFO L225 Difference]: With dead ends: 41 [2020-06-22 09:25:42,110 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:25:42,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:25:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:25:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-06-22 09:25:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:25:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2020-06-22 09:25:42,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 14 [2020-06-22 09:25:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:42,116 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2020-06-22 09:25:42,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-06-22 09:25:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2020-06-22 09:25:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:25:42,117 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:42,117 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:42,118 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:42,118 INFO L82 PathProgramCache]: Analyzing trace with hash -251937133, now seen corresponding path program 1 times [2020-06-22 09:25:42,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:42,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:42,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:42,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:42,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:42,194 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 09:25:42,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:42,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:42,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:42,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:25:42,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:42,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:42,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-06-22 09:25:42,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 09:25:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 09:25:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:25:42,279 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 9 states. [2020-06-22 09:25:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:42,445 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2020-06-22 09:25:42,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:25:42,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-06-22 09:25:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:42,446 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:25:42,446 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 09:25:42,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-06-22 09:25:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 09:25:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-06-22 09:25:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:25:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2020-06-22 09:25:42,451 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 45 transitions. Word has length 14 [2020-06-22 09:25:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:42,452 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 45 transitions. [2020-06-22 09:25:42,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 09:25:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions. [2020-06-22 09:25:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:25:42,452 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:42,453 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:42,453 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -251937132, now seen corresponding path program 1 times [2020-06-22 09:25:42,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:42,605 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 09:25:42,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:42,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:42,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:42,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 09:25:42,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:42,692 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:42,693 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 09:25:42,694 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:42,717 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-06-22 09:25:42,717 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:42,718 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-06-22 09:25:42,743 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:25:42,744 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:42,751 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:42,752 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:42,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 09:25:42,865 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:42,865 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 09:25:42,869 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:25:42,884 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:42,888 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:42,889 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 [2020-06-22 09:25:43,016 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 09:25:43,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:43,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-06-22 09:25:43,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:25:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:25:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:25:43,044 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 17 states. [2020-06-22 09:25:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:43,821 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2020-06-22 09:25:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:25:43,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-06-22 09:25:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:43,823 INFO L225 Difference]: With dead ends: 44 [2020-06-22 09:25:43,823 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 09:25:43,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:25:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 09:25:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-06-22 09:25:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 09:25:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2020-06-22 09:25:43,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 14 [2020-06-22 09:25:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:43,831 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2020-06-22 09:25:43,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:25:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2020-06-22 09:25:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:25:43,832 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:43,832 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:43,832 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 709473022, now seen corresponding path program 1 times [2020-06-22 09:25:43,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:43,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:43,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:44,055 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 09:25:44,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:44,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:44,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:44,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 09:25:44,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:44,117 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 09:25:44,117 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:44,127 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:44,128 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:44,128 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 09:25:44,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:44,168 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 09:25:44,168 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:44,183 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:44,184 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:44,184 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2020-06-22 09:25:44,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:44,286 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:44,287 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-06-22 09:25:44,288 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:25:44,304 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:44,308 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:44,309 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 [2020-06-22 09:25:44,432 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 09:25:44,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:44,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-06-22 09:25:44,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 09:25:44,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 09:25:44,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2020-06-22 09:25:44,461 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand 20 states. [2020-06-22 09:25:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:45,785 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2020-06-22 09:25:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-06-22 09:25:45,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 14 [2020-06-22 09:25:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:45,786 INFO L225 Difference]: With dead ends: 131 [2020-06-22 09:25:45,786 INFO L226 Difference]: Without dead ends: 130 [2020-06-22 09:25:45,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2020-06-22 09:25:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-06-22 09:25:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 50. [2020-06-22 09:25:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-06-22 09:25:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2020-06-22 09:25:45,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 14 [2020-06-22 09:25:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:45,799 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2020-06-22 09:25:45,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 09:25:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2020-06-22 09:25:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 09:25:45,800 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:45,801 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:45,801 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:45,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2050207449, now seen corresponding path program 2 times [2020-06-22 09:25:45,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:45,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:45,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:45,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:46,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:46,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:46,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:25:46,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:25:46,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:25:46,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2020-06-22 09:25:46,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:46,081 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:46,081 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 09:25:46,081 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:46,097 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 09:25:46,097 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:46,098 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 09:25:46,117 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:25:46,117 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:46,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:46,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:46,119 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 09:25:46,187 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:46,188 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 09:25:46,189 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:25:46,203 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:46,205 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:25:46,205 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-06-22 09:25:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:25:46,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:46,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-06-22 09:25:46,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 09:25:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 09:25:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-06-22 09:25:46,269 INFO L87 Difference]: Start difference. First operand 50 states and 77 transitions. Second operand 16 states. [2020-06-22 09:25:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:46,954 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-06-22 09:25:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 09:25:46,955 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-06-22 09:25:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:46,955 INFO L225 Difference]: With dead ends: 58 [2020-06-22 09:25:46,955 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 09:25:46,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2020-06-22 09:25:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 09:25:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2020-06-22 09:25:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:25:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2020-06-22 09:25:46,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 18 [2020-06-22 09:25:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:46,961 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2020-06-22 09:25:46,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 09:25:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2020-06-22 09:25:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 09:25:46,962 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:46,962 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:46,962 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1743781863, now seen corresponding path program 2 times [2020-06-22 09:25:46,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:46,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:46,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:47,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:47,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:25:47,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:25:47,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:25:47,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2020-06-22 09:25:47,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:47,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:47,451 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:25:47,452 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:47,462 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:47,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:47,463 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 09:25:47,512 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:25:47,512 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:47,524 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:47,525 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:47,526 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2020-06-22 09:25:47,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:47,589 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 09:25:47,590 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:47,601 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:47,602 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:47,602 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2020-06-22 09:25:47,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:47,746 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:47,746 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 09:25:47,747 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:25:47,762 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:47,765 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:47,765 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:27 [2020-06-22 09:25:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:25:47,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:47,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2020-06-22 09:25:47,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-06-22 09:25:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-06-22 09:25:47,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:25:47,960 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 25 states. [2020-06-22 09:25:48,751 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-06-22 09:25:49,202 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2020-06-22 09:25:50,269 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2020-06-22 09:25:50,658 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-06-22 09:25:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:53,037 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2020-06-22 09:25:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-06-22 09:25:53,038 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-06-22 09:25:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:53,039 INFO L225 Difference]: With dead ends: 131 [2020-06-22 09:25:53,039 INFO L226 Difference]: Without dead ends: 130 [2020-06-22 09:25:53,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=664, Invalid=3892, Unknown=0, NotChecked=0, Total=4556 [2020-06-22 09:25:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-06-22 09:25:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 64. [2020-06-22 09:25:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-06-22 09:25:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2020-06-22 09:25:53,057 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 20 [2020-06-22 09:25:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:53,058 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2020-06-22 09:25:53,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-06-22 09:25:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2020-06-22 09:25:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 09:25:53,059 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:53,059 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:53,059 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1940265577, now seen corresponding path program 1 times [2020-06-22 09:25:53,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:53,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:53,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:53,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:53,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:53,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:53,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2020-06-22 09:25:53,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:53,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:53,530 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:25:53,530 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:53,538 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:53,538 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:53,539 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 09:25:53,576 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:25:53,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:53,583 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:53,583 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:53,584 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-06-22 09:25:53,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:53,622 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 09:25:53,622 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:53,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:53,630 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:53,630 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2020-06-22 09:25:53,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:53,733 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:53,733 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 09:25:53,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:25:53,744 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:53,746 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:53,746 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2020-06-22 09:25:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:25:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:53,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2020-06-22 09:25:53,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-06-22 09:25:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-06-22 09:25:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:25:53,931 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand 25 states. [2020-06-22 09:25:57,461 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-06-22 09:25:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:58,381 INFO L93 Difference]: Finished difference Result 166 states and 251 transitions. [2020-06-22 09:25:58,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-06-22 09:25:58,382 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-06-22 09:25:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:58,382 INFO L225 Difference]: With dead ends: 166 [2020-06-22 09:25:58,382 INFO L226 Difference]: Without dead ends: 52 [2020-06-22 09:25:58,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=599, Invalid=3957, Unknown=0, NotChecked=0, Total=4556 [2020-06-22 09:25:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-06-22 09:25:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 27. [2020-06-22 09:25:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:25:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2020-06-22 09:25:58,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 20 [2020-06-22 09:25:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:58,391 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-06-22 09:25:58,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-06-22 09:25:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2020-06-22 09:25:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-06-22 09:25:58,392 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:58,392 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:58,393 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 09:25:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 291554143, now seen corresponding path program 1 times [2020-06-22 09:25:58,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 09:25:58,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:58,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:58,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:58,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2020-06-22 09:25:58,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:58,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:25:58,726 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:25:58,727 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:58,733 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:58,739 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:25:58,739 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:58,746 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:58,747 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:58,747 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 09:25:58,771 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:25:58,771 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:58,777 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:58,777 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:58,777 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 09:25:58,804 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 09:25:58,804 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:58,810 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:58,811 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:25:58,811 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 09:25:58,890 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:58,890 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 09:25:58,891 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:25:58,902 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:58,903 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:25:58,903 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-06-22 09:25:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 09:25:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2020-06-22 09:25:59,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-06-22 09:25:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 09:25:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-06-22 09:25:59,003 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 19 states. [2020-06-22 09:26:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:26:00,340 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2020-06-22 09:26:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 09:26:00,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2020-06-22 09:26:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:26:00,350 INFO L225 Difference]: With dead ends: 55 [2020-06-22 09:26:00,350 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:26:00,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2020-06-22 09:26:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:26:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:26:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:26:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:26:00,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-06-22 09:26:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:26:00,353 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:26:00,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-06-22 09:26:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:26:00,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:26:00,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:26:01,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:26:01,318 WARN L188 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 303 [2020-06-22 09:26:01,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:26:01,595 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 251 [2020-06-22 09:26:05,381 WARN L188 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 300 DAG size of output: 115 [2020-06-22 09:26:07,352 WARN L188 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 250 DAG size of output: 102 [2020-06-22 09:26:07,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 26) no Hoare annotation was computed. [2020-06-22 09:26:07,356 INFO L444 ceAbstractionStarter]: At program point L25(lines 14 27) the Hoare annotation is: (let ((.cse9 (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base)) (.cse25 (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (.cse24 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse23 (select |#length| ULTIMATE.start_cstrspn_~p~0.base))) (let ((.cse4 (<= 1 .cse23)) (.cse14 (= 0 ULTIMATE.start_cstrspn_~p~0.offset)) (.cse2 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~p~0.base)) (.cse3 (= ULTIMATE.start_main_~length1~0 .cse24)) (.cse6 (= (select |#valid| ULTIMATE.start_cstrspn_~p~0.base) 1)) (.cse7 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse8 (<= 1 .cse25)) (.cse0 (= ULTIMATE.start_cstrspn_~s2.offset 0)) (.cse18 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse11 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse12 (<= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse1 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse16 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse17 (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ .cse25 (- 1))) 0)) (.cse19 (= (select .cse9 (+ .cse23 (- 1))) 0)) (.cse5 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse20 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse24 (- 1))) 0)) (.cse21 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~p~0.base)))))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset)) .cse6 .cse7 .cse8 (= (select .cse9 ULTIMATE.start_cstrspn_~p~0.offset) 0) (= 1 ULTIMATE.start_main_~length1~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (and (and .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse0 .cse18 .cse10 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))) .cse13 .cse12 .cse15) .cse11 .cse19 .cse5 .cse1 .cse14 .cse20 .cse21) (and (let ((.cse22 (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base))) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ .cse22 (- 1)))) (and .cse2 (<= 1 ULTIMATE.start_cstrspn_~spanp~0.offset) .cse3 .cse6 (<= 1 ULTIMATE.start_cstrspn_~p~0.offset) .cse7 .cse8 .cse0 .cse18 .cse10 .cse11 .cse13 .cse12 .cse1 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~spanp~0.base)) .cse15) .cse16 .cse17 (<= (+ ULTIMATE.start_cstrspn_~spanp~0.offset 1) .cse22))) (<= (+ ULTIMATE.start_cstrspn_~p~0.offset 1) .cse23) .cse19 .cse5 .cse20 .cse21)))) [2020-06-22 09:26:07,356 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-06-22 09:26:07,356 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 25) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L444 ceAbstractionStarter]: At program point L23-5(lines 23 25) the Hoare annotation is: (let ((.cse27 (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (.cse28 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse29 (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base))) (let ((.cse19 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ .cse29 (- 1))))) (.cse12 (<= 1 ULTIMATE.start_cstrspn_~spanp~0.offset)) (.cse15 (<= (+ ULTIMATE.start_cstrspn_~spanp~0.offset 1) .cse29)) (.cse0 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~p~0.base)) (.cse1 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset))) (.cse2 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse3 (= (select |#valid| ULTIMATE.start_cstrspn_~p~0.base) 1)) (.cse4 (<= 1 ULTIMATE.start_cstrspn_~p~0.offset)) (.cse5 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse6 (= ULTIMATE.start_cstrspn_~s2.offset 0)) (.cse24 (<= 1 .cse29)) (.cse7 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse8 (<= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~spanp~0.base))) (.cse10 (= 0 ULTIMATE.start_cstrspn_~c~0)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse13 (= ULTIMATE.start_main_~length1~0 .cse28)) (.cse14 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse16 (<= 1 .cse27)) (.cse17 (= 1 ULTIMATE.start_main_~length1~0)) (.cse18 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse20 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_cstrspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))) (.cse21 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse26 (= 0 ULTIMATE.start_cstrspn_~spanp~0.offset)) (.cse22 (= ULTIMATE.start_main_~nondetString2~0.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 0 ULTIMATE.start_cstrspn_~sc~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse23 (select |#length| ULTIMATE.start_cstrspn_~p~0.base))) (and (or (<= (+ ULTIMATE.start_cstrspn_~p~0.offset 1) .cse23) .cse10) (and (let ((.cse25 (<= 1 ULTIMATE.start_main_~length1~0))) (or (and (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse16 .cse6 .cse24 .cse25 .cse18 .cse8 .cse21 .cse9 .cse11) .cse19 .cse26 .cse22 .cse2 (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ .cse27 (- 1))) 0)) (and .cse6 .cse19 .cse22 .cse2 (and .cse0 .cse12 .cse13 .cse3 .cse4 .cse5 .cse16 .cse25 .cse18 .cse20 .cse21 .cse8 .cse9 .cse11) .cse15))) .cse7 .cse14) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ .cse23 (- 1))) 0) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse28 (- 1))) 0) (<= ULTIMATE.start_cstrspn_~p~0.offset .cse23) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~p~0.base)))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse21 .cse26 .cse22 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= ULTIMATE.start_cstrspn_~spanp~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))))))) [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point L23-6(lines 23 25) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 29 43) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 09:26:07,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:26:07,358 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-06-22 09:26:07,358 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-06-22 09:26:07,358 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-06-22 09:26:07,358 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-06-22 09:26:07,358 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2020-06-22 09:26:07,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 09:26:07,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:26:07,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:26:07,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-06-22 09:26:07,359 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 37) no Hoare annotation was computed. [2020-06-22 09:26:07,359 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:26:07,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,445 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:07,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:07,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:07,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:07,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:26:07 BasicIcfg [2020-06-22 09:26:07,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:26:07,463 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:26:07,463 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:26:07,467 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:26:07,468 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:26:07,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:25:38" (1/5) ... [2020-06-22 09:26:07,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648eff4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:26:07, skipping insertion in model container [2020-06-22 09:26:07,468 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:26:07,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:38" (2/5) ... [2020-06-22 09:26:07,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648eff4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:26:07, skipping insertion in model container [2020-06-22 09:26:07,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:26:07,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:39" (3/5) ... [2020-06-22 09:26:07,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648eff4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:26:07, skipping insertion in model container [2020-06-22 09:26:07,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:26:07,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:25:39" (4/5) ... [2020-06-22 09:26:07,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648eff4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:26:07, skipping insertion in model container [2020-06-22 09:26:07,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:26:07,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:26:07" (5/5) ... [2020-06-22 09:26:07,471 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:26:07,492 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:26:07,493 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:26:07,493 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:26:07,493 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:26:07,493 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:26:07,493 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:26:07,493 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:26:07,493 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:26:07,493 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:26:07,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-06-22 09:26:07,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:26:07,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:26:07,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:26:07,505 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:26:07,505 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:26:07,505 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:26:07,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-06-22 09:26:07,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:26:07,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:26:07,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:26:07,507 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:26:07,507 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:26:07,512 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [140] ULTIMATE.startENTRY-->L32: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 14#L32true [92] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 8#L32-2true [78] L32-2-->L35-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 19#L35-1true [111] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 7#L40true [61] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 5#L40-1true [141] L40-1-->L25: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_5) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 v_ULTIMATE.start_cstrspn_~p~0.offset_6) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrspn_~p~0.base_7 v_ULTIMATE.start_cstrspn_~s1.base_5) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_6, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_6, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_6|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_4|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_8|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_6, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_7|, #length=|v_#length_12|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_7|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_6, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~p~0.offset, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, #memory_int, ULTIMATE.start_cstrspn_#in~s1.base, ULTIMATE.start_cstrspn_~s2.base] 23#L25true [2020-06-22 09:26:07,513 INFO L796 eck$LassoCheckResult]: Loop: 23#L25true [72] L25-->L22: Formula: (and (= |v_ULTIMATE.start_cstrspn_#t~post0.base_2| v_ULTIMATE.start_cstrspn_~p~0.base_4) (= |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| v_ULTIMATE.start_cstrspn_~p~0.offset_4) (= v_ULTIMATE.start_cstrspn_~p~0.base_3 |v_ULTIMATE.start_cstrspn_#t~post0.base_2|) (= v_ULTIMATE.start_cstrspn_~p~0.offset_3 (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_4, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_4} OutVars{ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_2|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_2|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_3, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_~p~0.offset] 17#L22true [142] L22-->L23-5: Formula: (and (= v_ULTIMATE.start_cstrspn_~s2.base_5 v_ULTIMATE.start_cstrspn_~spanp~0.base_7) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) v_ULTIMATE.start_cstrspn_~c~0_7) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrspn_~s2.offset_5 v_ULTIMATE.start_cstrspn_~spanp~0.offset_7) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_9|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_8|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_7, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_7|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset] 6#L23-5true [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 18#L23-1true [143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3] 12#L23-3true [136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3] 22#L24true [90] L24-->L25: Formula: (= v_ULTIMATE.start_cstrspn_~sc~0_6 v_ULTIMATE.start_cstrspn_~c~0_4) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_6} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_6} AuxVars[] AssignedVars[] 23#L25true [2020-06-22 09:26:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 688013858, now seen corresponding path program 1 times [2020-06-22 09:26:07,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:07,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:07,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1212618916, now seen corresponding path program 1 times [2020-06-22 09:26:07,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:07,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:07,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:07,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1003533123, now seen corresponding path program 1 times [2020-06-22 09:26:07,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:07,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:26:07,626 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 09:26:07,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:26:07,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 09:26:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:26:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:26:07,729 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 8 states. [2020-06-22 09:26:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:26:08,010 INFO L93 Difference]: Finished difference Result 40 states and 67 transitions. [2020-06-22 09:26:08,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 09:26:08,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 67 transitions. [2020-06-22 09:26:08,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:26:08,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 12 states and 19 transitions. [2020-06-22 09:26:08,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 09:26:08,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 09:26:08,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2020-06-22 09:26:08,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:26:08,017 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-06-22 09:26:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2020-06-22 09:26:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 09:26:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 09:26:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2020-06-22 09:26:08,019 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-06-22 09:26:08,020 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-06-22 09:26:08,020 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:26:08,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 19 transitions. [2020-06-22 09:26:08,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:26:08,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:26:08,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:26:08,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:26:08,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:26:08,022 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY [140] ULTIMATE.startENTRY-->L32: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 89#L32 [92] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 90#L32-2 [93] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 97#L35-1 [111] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 98#L40 [61] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 95#L40-1 [141] L40-1-->L25: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_5) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 v_ULTIMATE.start_cstrspn_~p~0.offset_6) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrspn_~p~0.base_7 v_ULTIMATE.start_cstrspn_~s1.base_5) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_6, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_6, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_6|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_4|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_8|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_6, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_7|, #length=|v_#length_12|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_7|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_6, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~p~0.offset, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, #memory_int, ULTIMATE.start_cstrspn_#in~s1.base, ULTIMATE.start_cstrspn_~s2.base] 96#L25 [2020-06-22 09:26:08,022 INFO L796 eck$LassoCheckResult]: Loop: 96#L25 [72] L25-->L22: Formula: (and (= |v_ULTIMATE.start_cstrspn_#t~post0.base_2| v_ULTIMATE.start_cstrspn_~p~0.base_4) (= |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| v_ULTIMATE.start_cstrspn_~p~0.offset_4) (= v_ULTIMATE.start_cstrspn_~p~0.base_3 |v_ULTIMATE.start_cstrspn_#t~post0.base_2|) (= v_ULTIMATE.start_cstrspn_~p~0.offset_3 (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_4, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_4} OutVars{ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_2|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_2|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_3, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_~p~0.offset] 93#L22 [142] L22-->L23-5: Formula: (and (= v_ULTIMATE.start_cstrspn_~s2.base_5 v_ULTIMATE.start_cstrspn_~spanp~0.base_7) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) v_ULTIMATE.start_cstrspn_~c~0_7) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrspn_~s2.offset_5 v_ULTIMATE.start_cstrspn_~spanp~0.offset_7) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_9|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_8|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_7, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_7|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset] 94#L23-5 [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 91#L23-1 [143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3] 92#L23-3 [136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3] 99#L24 [90] L24-->L25: Formula: (= v_ULTIMATE.start_cstrspn_~sc~0_6 v_ULTIMATE.start_cstrspn_~c~0_4) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_6} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_6} AuxVars[] AssignedVars[] 96#L25 [2020-06-22 09:26:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 688460723, now seen corresponding path program 1 times [2020-06-22 09:26:08,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:08,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:08,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:08,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1212618916, now seen corresponding path program 2 times [2020-06-22 09:26:08,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:08,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 343731598, now seen corresponding path program 1 times [2020-06-22 09:26:08,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:08,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:26:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:08,377 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2020-06-22 09:26:08,489 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:26:08,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:26:08,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:26:08,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:26:08,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:26:08,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:26:08,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:26:08,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:26:08,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:26:08,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:26:08,492 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:26:08,507 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 09:26:08,512 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 09:26:08,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:26:08,516 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 09:26:08,520 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 09:26:08,522 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 09:26:08,523 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 09:26:08,779 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-06-22 09:26:08,886 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 09:26:08,888 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 09:26:08,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 09:26:08,891 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 09:26:08,893 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 09:26:08,894 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 09:26:08,896 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 09:26:09,241 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:26:09,246 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:26:09,248 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 09:26:09,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,256 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 09:26:09,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,258 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 09:26:09,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,261 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 09:26:09,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,263 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 09:26:09,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,269 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 09:26:09,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,271 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 09:26:09,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,274 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 09:26:09,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,278 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 09:26:09,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,284 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 09:26:09,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,294 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 09:26:09,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:09,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:09,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:09,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:09,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,303 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 09:26:09,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,315 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 09:26:09,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:09,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:09,324 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 09:26:09,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:09,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:09,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:09,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:09,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:09,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:09,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:26:09,381 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 09:26:09,381 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:26:09,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:26:09,385 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:26:09,386 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:26:09,386 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cstrspn_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 Supporting invariants [] [2020-06-22 09:26:09,411 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-06-22 09:26:09,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:26:09,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:26:09,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:26:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:26:09,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:26:09,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:26:09,523 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 09:26:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:26:09,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:26:09,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:26:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:26:09,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:26:09,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:26:09,653 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 09:26:09,657 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2020-06-22 09:26:09,658 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 19 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-06-22 09:26:09,781 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 19 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 22 states and 32 transitions. Complement of second has 7 states. [2020-06-22 09:26:09,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 09:26:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:26:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-06-22 09:26:09,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 09:26:09,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:26:09,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 12 letters. Loop has 6 letters. [2020-06-22 09:26:09,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:26:09,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 12 letters. [2020-06-22 09:26:09,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:26:09,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 32 transitions. [2020-06-22 09:26:09,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:26:09,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 29 transitions. [2020-06-22 09:26:09,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 09:26:09,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 09:26:09,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. [2020-06-22 09:26:09,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:26:09,793 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 09:26:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. [2020-06-22 09:26:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 09:26:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:26:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 09:26:09,794 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:26:09,795 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:26:09,795 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:26:09,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-06-22 09:26:09,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:26:09,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:26:09,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:26:09,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:26:09,796 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:26:09,797 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY [140] ULTIMATE.startENTRY-->L32: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 265#L32 [92] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 266#L32-2 [93] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 277#L35-1 [111] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 278#L40 [61] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 273#L40-1 [141] L40-1-->L25: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_5) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 v_ULTIMATE.start_cstrspn_~p~0.offset_6) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrspn_~p~0.base_7 v_ULTIMATE.start_cstrspn_~s1.base_5) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_6, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_6, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_6|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_4|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_8|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_6, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_7|, #length=|v_#length_12|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_7|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_6, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~p~0.offset, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, #memory_int, ULTIMATE.start_cstrspn_#in~s1.base, ULTIMATE.start_cstrspn_~s2.base] 274#L25 [72] L25-->L22: Formula: (and (= |v_ULTIMATE.start_cstrspn_#t~post0.base_2| v_ULTIMATE.start_cstrspn_~p~0.base_4) (= |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| v_ULTIMATE.start_cstrspn_~p~0.offset_4) (= v_ULTIMATE.start_cstrspn_~p~0.base_3 |v_ULTIMATE.start_cstrspn_#t~post0.base_2|) (= v_ULTIMATE.start_cstrspn_~p~0.offset_3 (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_4, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_4} OutVars{ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_2|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_2|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_3, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_~p~0.offset] 271#L22 [142] L22-->L23-5: Formula: (and (= v_ULTIMATE.start_cstrspn_~s2.base_5 v_ULTIMATE.start_cstrspn_~spanp~0.base_7) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) v_ULTIMATE.start_cstrspn_~c~0_7) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrspn_~s2.offset_5 v_ULTIMATE.start_cstrspn_~spanp~0.offset_7) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_9|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_8|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_7, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_7|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset] 272#L23-5 [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 267#L23-1 [2020-06-22 09:26:09,797 INFO L796 eck$LassoCheckResult]: Loop: 267#L23-1 [143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3] 268#L23-3 [136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3] 279#L24 [138] L24-->L23-5: Formula: (> v_ULTIMATE.start_cstrspn_~sc~0_7 v_ULTIMATE.start_cstrspn_~c~0_5) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} AuxVars[] AssignedVars[] 275#L23-5 [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 267#L23-1 [2020-06-22 09:26:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1464634163, now seen corresponding path program 1 times [2020-06-22 09:26:09,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:09,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:09,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:09,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash 5318684, now seen corresponding path program 1 times [2020-06-22 09:26:09,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2065746510, now seen corresponding path program 1 times [2020-06-22 09:26:09,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:09,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:09,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:10,350 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2020-06-22 09:26:10,489 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-06-22 09:26:10,491 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:26:10,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:26:10,492 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:26:10,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:26:10,492 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:26:10,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:26:10,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:26:10,492 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:26:10,492 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:26:10,492 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:26:10,493 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:26:10,495 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 09:26:10,497 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 09:26:10,500 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 09:26:10,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:26:10,502 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 09:26:10,504 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 09:26:10,506 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 09:26:10,508 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 09:26:10,509 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 09:26:10,817 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2020-06-22 09:26:10,856 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 09:26:10,857 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 09:26:10,859 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 09:26:11,081 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-06-22 09:26:11,268 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:26:11,268 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:26:11,269 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 09:26:11,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,272 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 09:26:11,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,275 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 09:26:11,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,277 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 09:26:11,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,279 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 09:26:11,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,280 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 09:26:11,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,283 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 09:26:11,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,285 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 09:26:11,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,287 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 09:26:11,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,295 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 09:26:11,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,303 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 09:26:11,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,307 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 09:26:11,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,315 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 09:26:11,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,319 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 09:26:11,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,323 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 09:26:11,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,327 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 09:26:11,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,352 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 09:26:11,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,356 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 09:26:11,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:11,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:11,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,359 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 09:26:11,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,361 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 09:26:11,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,363 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 09:26:11,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:11,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:11,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,364 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 09:26:11,364 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 09:26:11,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,366 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,367 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 09:26:11,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,368 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,368 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,371 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 09:26:11,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,372 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,372 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,373 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 09:26:11,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,374 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,374 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,375 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 09:26:11,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,376 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,377 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 09:26:11,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,378 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,379 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,379 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,380 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 09:26:11,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,381 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,381 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,382 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 09:26:11,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,383 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,383 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,384 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 09:26:11,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,387 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,387 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,396 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 09:26:11,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,397 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,399 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,399 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,405 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 09:26:11,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,407 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,407 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,408 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 09:26:11,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,411 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,411 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,419 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 09:26:11,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,421 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,421 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,424 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 09:26:11,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,425 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,426 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,426 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,430 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 09:26:11,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,430 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,431 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,431 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,434 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 09:26:11,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,435 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,439 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,439 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,475 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 09:26:11,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,476 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,477 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,477 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,478 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 09:26:11,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,479 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,480 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,480 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,481 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 09:26:11,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,482 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,483 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 09:26:11,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,484 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,484 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,485 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 09:26:11,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,487 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 09:26:11,487 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 09:26:11,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,489 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 09:26:11,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,490 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,491 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,493 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 09:26:11,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,495 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 09:26:11,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,496 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,497 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 09:26:11,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,499 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 09:26:11,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,500 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,501 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,501 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,503 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 09:26:11,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,505 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 09:26:11,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,506 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,507 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 09:26:11,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,510 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,510 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,519 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 09:26:11,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,521 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,522 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,530 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 09:26:11,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,532 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,532 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,534 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 09:26:11,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,537 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,537 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,546 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 09:26:11,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,548 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,548 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:11,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,552 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,553 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,553 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,558 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 09:26:11,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,560 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,560 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,564 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 09:26:11,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,569 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,569 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,604 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 09:26:11,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,604 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,605 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,606 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,608 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 09:26:11,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,609 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,610 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,610 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:11,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,612 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 09:26:11,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,614 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 09:26:11,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,615 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,616 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 09:26:11,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,618 INFO L497 LassoAnalysis]: Using template '4-nested'. [2020-06-22 09:26:11,618 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 09:26:11,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,619 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,620 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,620 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 09:26:11,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,621 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,622 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,622 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,625 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 09:26:11,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,626 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,627 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 09:26:11,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,628 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,629 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 09:26:11,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,631 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 09:26:11,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,632 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,633 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,633 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,635 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 09:26:11,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,636 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,637 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:11,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,639 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,640 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 09:26:11,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,641 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,643 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,643 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,654 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 09:26:11,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,655 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,657 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,657 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,666 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 09:26:11,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,667 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,668 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,668 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,670 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 09:26:11,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,671 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,673 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,674 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,685 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 09:26:11,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,685 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,687 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,687 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,690 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 09:26:11,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,691 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,692 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,692 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,698 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 09:26:11,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,698 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,699 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,700 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,703 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 09:26:11,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,704 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,709 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,709 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,748 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 09:26:11,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,749 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,750 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,752 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 09:26:11,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,753 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:11,754 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:11,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,756 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 09:26:11,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,757 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,758 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 09:26:11,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,759 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,760 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 09:26:11,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:11,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,760 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:11,761 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:11,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,762 INFO L497 LassoAnalysis]: Using template '2-phase'. [2020-06-22 09:26:11,762 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 09:26:11,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,762 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,763 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,764 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 09:26:11,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,765 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,766 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,766 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,769 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 09:26:11,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,769 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,770 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,770 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,771 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 09:26:11,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,771 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,773 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 09:26:11,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,774 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,774 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,775 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 09:26:11,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,776 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,777 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,777 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,780 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 09:26:11,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,781 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,782 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 09:26:11,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,783 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,784 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 09:26:11,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,787 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,787 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,796 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 09:26:11,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,797 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,797 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,799 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,799 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:11,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,807 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,808 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,808 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,811 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 09:26:11,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,811 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,813 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,814 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:11,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,823 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,824 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,824 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,827 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 09:26:11,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,828 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,829 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,829 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,834 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 09:26:11,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,835 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,836 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,837 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,840 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 09:26:11,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,840 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,841 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,845 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,845 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,973 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 09:26:11,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,974 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,975 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,975 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,978 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 09:26:11,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,979 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,980 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:11,980 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:11,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,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 09:26:11,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,984 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,985 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,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 09:26:11,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,989 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 09:26:11,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:11,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,990 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:11,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:11,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,991 INFO L497 LassoAnalysis]: Using template '3-phase'. [2020-06-22 09:26:11,992 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 09:26:11,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,992 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:11,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:11,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:11,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:11,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:11,995 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 09:26:11,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:11,996 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:11,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:11,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:11,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:11,997 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:11,998 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,001 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 09:26:12,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,002 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,003 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,005 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 09:26:12,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,005 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,006 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,006 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,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 09:26:12,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,009 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,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 09:26:12,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,012 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,014 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,014 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,017 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 09:26:12,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,018 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,021 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 09:26:12,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,021 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,022 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,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 09:26:12,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,025 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,028 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,028 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,041 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 09:26:12,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,144 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,144 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,155 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 09:26:12,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,156 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,156 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,157 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,157 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:12,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,161 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,164 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,165 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,179 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 09:26:12,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,179 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,181 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,181 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,185 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 09:26:12,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,186 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,188 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,188 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,194 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 09:26:12,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,194 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,196 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,196 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,200 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 09:26:12,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,201 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,201 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,208 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,209 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,399 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 09:26:12,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,399 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,400 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,401 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,401 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,404 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 09:26:12,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,405 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,406 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:12,407 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:12,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,410 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 09:26:12,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,410 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,411 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,412 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 09:26:12,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,413 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,413 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,414 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,415 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 09:26:12,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,416 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:12,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:12,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:12,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,418 INFO L497 LassoAnalysis]: Using template '4-phase'. [2020-06-22 09:26:12,418 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 09:26:12,418 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,418 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,419 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,420 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:12,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,421 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 09:26:12,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,421 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,422 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,423 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,423 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,429 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 09:26:12,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,429 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,430 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,430 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:12,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,432 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 09:26:12,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,433 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:12,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,435 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 09:26:12,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,436 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,436 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:12,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,438 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 09:26:12,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,438 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,439 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,440 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,440 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,445 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 09:26:12,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,446 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,447 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:12,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,448 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 09:26:12,449 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,449 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:12,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,449 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,450 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:12,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:12,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,451 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 09:26:12,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,452 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,452 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,455 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,455 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,472 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 09:26:12,473 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,473 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,473 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,476 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,476 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,492 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 09:26:12,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,492 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,493 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,494 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,494 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,500 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 09:26:12,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,500 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,504 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,504 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,522 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 09:26:12,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,523 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,525 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,525 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,531 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 09:26:12,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,531 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,533 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,534 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,542 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 09:26:12,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,544 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,544 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:12,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:12,550 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 09:26:12,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:12,551 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:12,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:12,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:12,552 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:12,559 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:12,560 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:13,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,140 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 09:26:13,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:13,142 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:13,142 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:13,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,148 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 09:26:13,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:13,150 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:13,150 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:13,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,155 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 09:26:13,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:13,157 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:13,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,158 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 09:26:13,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,160 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:13,160 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:13,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:13,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,162 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,162 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:13,163 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:13,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,164 INFO L497 LassoAnalysis]: Using template '2-lex'. [2020-06-22 09:26:13,165 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 09:26:13,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,168 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 09:26:13,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,169 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,169 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,170 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,172 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 09:26:13,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,173 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,175 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 09:26:13,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,176 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,178 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 09:26:13,178 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,179 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,181 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 09:26:13,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,183 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,183 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,186 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 09:26:13,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,186 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,187 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,189 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 09:26:13,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,190 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,190 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,192 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 09:26:13,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,192 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,194 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,195 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,204 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 09:26:13,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,205 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,207 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,207 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,218 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 09:26:13,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,218 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,219 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,219 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,220 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,222 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 09:26:13,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,223 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,223 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,225 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,225 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,237 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 09:26:13,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,238 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,238 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,239 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,239 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,242 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 09:26:13,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,243 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,243 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,244 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,245 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,251 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 09:26:13,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,253 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,253 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,256 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 09:26:13,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,257 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,257 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,261 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,262 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,343 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 09:26:13,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,343 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,345 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,345 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,348 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 09:26:13,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,348 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,350 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:13,350 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:13,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,353 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 09:26:13,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,353 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,354 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,354 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,356 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 09:26:13,356 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,356 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,357 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,359 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 09:26:13,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:13,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,360 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:13,360 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:13,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,361 INFO L497 LassoAnalysis]: Using template '3-lex'. [2020-06-22 09:26:13,362 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 09:26:13,362 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,362 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,363 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,365 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 09:26:13,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,365 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,366 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,367 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,367 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,371 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 09:26:13,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,372 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,372 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,375 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 09:26:13,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,375 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,376 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:13,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,379 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,382 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 09:26:13,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,383 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,384 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,384 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,388 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 09:26:13,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,389 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,389 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,392 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 09:26:13,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,393 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,394 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,396 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 09:26:13,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,397 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,397 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,400 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,400 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:13,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,418 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,420 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,420 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,439 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 09:26:13,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,440 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,442 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,442 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:13,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,447 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,447 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,450 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,450 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,484 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 09:26:13,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,485 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,485 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,486 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,487 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,491 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 09:26:13,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,492 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,492 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,494 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,494 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,504 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 09:26:13,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,505 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,505 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,507 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,507 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,511 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 09:26:13,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,512 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,513 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,519 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,519 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,842 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 09:26:13,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,843 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,843 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,844 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,845 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,849 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 09:26:13,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,850 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,850 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,851 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:13,851 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:13,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,856 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 09:26:13,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,856 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,857 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:13,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,860 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,863 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 09:26:13,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:13,863 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:13,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:13,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:13,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:13,864 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:13,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:13,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:13,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:13,866 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2020-06-22 09:26:13,867 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY [140] ULTIMATE.startENTRY-->L32: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0] 265#L32 [92] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 266#L32-2 [93] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 277#L35-1 [111] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 278#L40 [61] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 273#L40-1 [141] L40-1-->L25: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_5) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 v_ULTIMATE.start_cstrspn_~p~0.offset_6) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrspn_~p~0.base_7 v_ULTIMATE.start_cstrspn_~s1.base_5) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_6, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_6, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_6|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_4|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_8|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_6, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_7|, #length=|v_#length_12|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_7|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_6, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~p~0.offset, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, #memory_int, ULTIMATE.start_cstrspn_#in~s1.base, ULTIMATE.start_cstrspn_~s2.base] 274#L25 [72] L25-->L22: Formula: (and (= |v_ULTIMATE.start_cstrspn_#t~post0.base_2| v_ULTIMATE.start_cstrspn_~p~0.base_4) (= |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| v_ULTIMATE.start_cstrspn_~p~0.offset_4) (= v_ULTIMATE.start_cstrspn_~p~0.base_3 |v_ULTIMATE.start_cstrspn_#t~post0.base_2|) (= v_ULTIMATE.start_cstrspn_~p~0.offset_3 (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_4, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_4} OutVars{ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_2|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_2|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_3, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_~p~0.offset] 271#L22 [142] L22-->L23-5: Formula: (and (= v_ULTIMATE.start_cstrspn_~s2.base_5 v_ULTIMATE.start_cstrspn_~spanp~0.base_7) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) v_ULTIMATE.start_cstrspn_~c~0_7) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrspn_~s2.offset_5 v_ULTIMATE.start_cstrspn_~spanp~0.offset_7) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_9|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_8|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_7, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_7|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset] 272#L23-5 [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 267#L23-1 [143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3] 268#L23-3 [136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3] 279#L24 [138] L24-->L23-5: Formula: (> v_ULTIMATE.start_cstrspn_~sc~0_7 v_ULTIMATE.start_cstrspn_~c~0_5) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} AuxVars[] AssignedVars[] 275#L23-5 [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 267#L23-1 [2020-06-22 09:26:13,868 INFO L796 eck$LassoCheckResult]: Loop: 267#L23-1 [143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3] 268#L23-3 [136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3] 279#L24 [138] L24-->L23-5: Formula: (> v_ULTIMATE.start_cstrspn_~sc~0_7 v_ULTIMATE.start_cstrspn_~c~0_5) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} AuxVars[] AssignedVars[] 275#L23-5 [76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base] 267#L23-1 [2020-06-22 09:26:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2065746510, now seen corresponding path program 2 times [2020-06-22 09:26:13,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:13,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:26:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 5318684, now seen corresponding path program 2 times [2020-06-22 09:26:13,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:13,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:13,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:26:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:26:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 238683113, now seen corresponding path program 3 times [2020-06-22 09:26:13,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:26:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:26:13,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:13,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:26:13,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:26:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:26:14,608 WARN L188 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 124 [2020-06-22 09:26:14,762 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-06-22 09:26:14,764 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:26:14,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:26:14,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:26:14,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:26:14,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:26:14,764 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:26:14,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:26:14,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:26:14,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:26:14,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:26:14,765 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:26:14,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:26:14,770 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 09:26:14,773 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 09:26:14,774 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 09:26:14,776 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 09:26:14,778 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 09:26:14,779 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 09:26:14,781 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 09:26:15,113 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2020-06-22 09:26:15,156 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 09:26:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:26:15,159 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 09:26:15,160 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 09:26:15,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:26:15,507 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:26:15,508 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 09:26:15,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,510 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 09:26:15,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,512 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 09:26:15,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,514 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 09:26:15,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,515 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 09:26:15,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,518 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 09:26:15,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,519 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 09:26:15,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,521 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 09:26:15,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,523 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 09:26:15,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,527 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 09:26:15,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,532 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 09:26:15,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,534 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 09:26:15,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,540 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 09:26:15,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:15,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,547 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 09:26:15,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,550 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 09:26:15,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:15,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:26:15,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,568 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 09:26:15,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,570 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 09:26:15,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,571 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 09:26:15,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,573 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 09:26:15,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:26:15,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:26:15,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,574 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 09:26:15,574 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 09:26:15,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,575 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,576 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 09:26:15,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,576 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,577 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,577 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,578 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 09:26:15,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,579 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,580 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 09:26:15,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,580 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,581 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,581 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 09:26:15,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,582 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,582 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,583 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,584 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 09:26:15,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,584 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,585 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 09:26:15,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,586 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,586 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,587 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 09:26:15,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,588 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,588 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,589 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 09:26:15,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,590 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,590 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,591 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,594 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 09:26:15,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,596 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,596 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,601 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 09:26:15,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,602 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,602 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,603 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 09:26:15,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,605 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,605 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,611 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 09:26:15,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,613 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,613 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,618 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 09:26:15,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,619 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,619 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,619 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,621 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 09:26:15,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,622 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,622 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,622 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,624 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 09:26:15,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,627 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,627 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,648 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 09:26:15,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,649 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:15,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,650 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,651 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,651 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 09:26:15,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,652 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,652 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,653 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 09:26:15,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,654 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,654 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,654 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 09:26:15,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:15,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,656 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 09:26:15,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,657 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,658 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,658 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,659 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 09:26:15,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,661 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 09:26:15,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,663 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 09:26:15,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,664 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,664 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,666 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 09:26:15,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,667 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,668 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 09:26:15,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,669 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,670 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 09:26:15,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,671 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,671 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,673 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 09:26:15,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,674 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,674 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,679 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 09:26:15,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,681 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,681 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,688 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 09:26:15,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,689 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,690 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,690 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,692 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 09:26:15,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,694 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,694 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,702 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 09:26:15,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,704 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,704 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,710 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 09:26:15,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,712 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,712 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,714 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 09:26:15,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,715 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,715 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,716 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,717 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 09:26:15,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,718 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,721 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:15,721 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:15,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,746 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 09:26:15,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,747 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,748 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 09:26:15,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,749 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,750 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 09:26:15,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,751 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 09:26:15,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,752 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:15,752 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:15,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,753 INFO L497 LassoAnalysis]: Using template '4-nested'. [2020-06-22 09:26:15,753 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 09:26:15,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,754 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,754 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,755 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 09:26:15,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,755 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,756 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,756 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,758 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 09:26:15,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,759 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,760 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 09:26:15,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,760 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,761 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,761 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 09:26:15,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,762 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,763 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,763 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,765 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 09:26:15,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,765 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,766 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,766 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 09:26:15,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,767 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,767 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,768 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 09:26:15,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,769 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,770 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,770 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,771 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 09:26:15,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,772 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,773 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,773 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,778 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 09:26:15,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,779 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,780 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,780 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,789 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 09:26:15,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,789 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,790 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,790 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,792 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 09:26:15,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,794 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,795 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,803 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 09:26:15,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,804 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,806 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,806 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,813 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 09:26:15,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,814 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,815 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,815 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,817 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 09:26:15,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,818 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,819 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,819 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,821 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 09:26:15,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,825 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:15,826 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:15,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,863 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 09:26:15,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,876 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,877 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 09:26:15,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,878 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,879 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 09:26:15,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,880 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,880 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 09:26:15,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:26:15,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,881 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:15,881 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:15,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,882 INFO L497 LassoAnalysis]: Using template '2-phase'. [2020-06-22 09:26:15,882 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 09:26:15,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,883 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,883 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,884 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,884 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 09:26:15,885 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,885 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,885 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,886 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,886 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,888 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 09:26:15,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,889 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:15,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,890 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,891 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,891 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,892 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 09:26:15,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,893 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,893 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,893 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,896 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 09:26:15,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,896 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,896 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,898 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 09:26:15,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:15,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:15,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:15,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,900 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 09:26:15,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,900 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,901 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,901 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,903 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 09:26:15,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,903 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,905 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,905 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,909 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 09:26:15,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,909 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,911 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,911 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,918 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 09:26:15,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,919 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,920 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,920 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,922 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 09:26:15,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,923 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,924 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,924 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,932 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 09:26:15,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,932 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,932 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,934 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,934 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,940 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 09:26:15,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,940 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,941 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,942 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,944 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 09:26:15,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,945 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,945 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,946 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:15,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:15,948 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 09:26:15,948 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:15,948 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:15,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:15,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:15,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:15,951 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-06-22 09:26:15,952 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-06-22 09:26:16,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,040 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 09:26:16,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,041 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:16,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:16,042 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:16,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,043 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 09:26:16,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:16,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:16,044 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:16,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,045 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 09:26:16,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,045 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:16,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,046 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:16,046 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:16,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,047 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 09:26:16,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:16,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,048 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 09:26:16,048 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 09:26:16,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,049 INFO L497 LassoAnalysis]: Using template '3-phase'. [2020-06-22 09:26:16,049 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 09:26:16,049 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,049 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,050 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,051 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 09:26:16,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,052 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,052 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,053 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,053 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,056 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 09:26:16,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,056 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,057 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,057 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,058 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 09:26:16,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,059 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,059 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,061 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 09:26:16,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,061 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,062 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,062 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,063 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,065 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 09:26:16,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,066 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,068 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 09:26:16,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,068 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,070 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 09:26:16,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,071 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,072 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,072 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,075 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 09:26:16,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,075 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,076 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,077 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,077 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:16,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,084 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,086 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,086 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:16,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,097 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,098 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,098 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,101 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 09:26:16,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,101 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,102 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,104 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,104 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,114 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 09:26:16,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,115 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,115 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,117 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,117 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,126 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 09:26:16,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,126 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,128 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,128 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,134 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 09:26:16,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,135 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,135 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,136 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,136 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,139 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 09:26:16,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,140 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,145 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:16,145 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:16,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,560 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 09:26:16,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,561 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,563 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 09:26:16,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,564 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,564 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,564 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,566 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 09:26:16,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,566 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,567 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,568 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 09:26:16,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,569 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 09:26:16,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:16,570 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:16,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,571 INFO L497 LassoAnalysis]: Using template '4-phase'. [2020-06-22 09:26:16,571 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 09:26:16,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,571 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,572 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,572 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:16,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,573 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 09:26:16,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,574 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,576 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,576 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,580 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 09:26:16,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,581 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,581 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,582 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:16,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,583 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 09:26:16,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,583 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,584 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,585 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:16,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,586 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 09:26:16,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,586 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,586 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,588 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,588 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,592 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 09:26:16,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,592 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,593 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,594 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:16,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,595 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 09:26:16,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,595 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:16,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,596 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,596 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:16,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:16,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,597 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 09:26:16,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,598 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,598 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,600 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,600 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,604 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 09:26:16,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,605 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,607 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,607 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,615 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 09:26:16,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,615 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,619 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,619 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,632 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 09:26:16,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,632 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,633 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,634 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,634 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:16,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,639 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,639 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,642 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,642 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,656 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 09:26:16,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,657 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,658 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,660 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,660 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,672 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 09:26:16,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,673 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,673 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,675 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,675 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,680 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 09:26:16,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,680 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,680 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,682 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,682 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:16,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:16,686 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 09:26:16,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:16,687 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:16,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:16,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:16,687 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:16,694 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2020-06-22 09:26:16,694 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2020-06-22 09:26:17,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,307 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 09:26:17,307 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,307 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,308 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:17,309 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:17,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,310 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 09:26:17,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,311 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:17,312 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:17,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,313 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 09:26:17,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,313 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,314 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:17,314 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:17,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,315 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 09:26:17,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,316 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,317 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 09:26:17,317 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 09:26:17,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,318 INFO L497 LassoAnalysis]: Using template '2-lex'. [2020-06-22 09:26:17,319 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 09:26:17,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,319 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,320 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,321 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 09:26:17,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,322 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,323 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,323 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,381 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,384 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 09:26:17,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,385 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,385 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,385 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,387 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 09:26:17,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,387 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,388 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,388 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,389 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 09:26:17,389 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,390 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,391 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,391 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,393 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 09:26:17,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,394 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,396 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 09:26:17,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,396 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,397 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,398 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 09:26:17,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,399 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,400 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,400 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,402 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 09:26:17,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,403 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,403 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,404 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,404 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,410 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 09:26:17,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,410 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,412 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,412 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,427 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 09:26:17,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,428 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,428 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,429 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,429 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,432 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 09:26:17,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,432 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,433 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,434 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,434 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:17,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,447 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,448 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,448 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,456 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 09:26:17,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,456 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,457 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,457 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,460 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 09:26:17,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,460 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,462 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,462 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,464 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 09:26:17,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,465 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,468 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-06-22 09:26:17,468 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-06-22 09:26:17,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,581 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 09:26:17,582 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,582 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,584 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 09:26:17,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,584 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,585 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,585 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,586 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 09:26:17,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,587 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,589 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 09:26:17,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,589 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 09:26:17,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,590 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 09:26:17,590 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 09:26:17,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,591 INFO L497 LassoAnalysis]: Using template '3-lex'. [2020-06-22 09:26:17,591 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 09:26:17,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,592 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,592 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:17,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,594 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 09:26:17,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,595 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,595 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,596 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,596 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,600 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 09:26:17,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,601 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:17,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,603 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 09:26:17,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,603 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,604 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:17,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,606 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 09:26:17,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,607 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,607 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,608 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,611 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 09:26:17,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,611 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,612 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:17,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,615 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 09:26:17,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,615 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:17,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,615 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:17,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:17,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,618 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 09:26:17,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,618 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,618 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,619 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,619 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,623 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 09:26:17,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,623 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,624 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,625 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,625 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,635 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 09:26:17,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,636 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,636 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,638 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,638 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,677 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 09:26:17,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,678 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,678 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,679 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,679 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,683 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 09:26:17,683 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,683 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,684 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,686 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,686 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,714 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 09:26:17,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,715 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,717 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,717 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,728 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 09:26:17,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,728 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,729 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,730 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,730 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,734 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 09:26:17,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,734 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,735 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,736 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,736 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:17,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:17,740 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 09:26:17,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:17,740 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:17,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:17,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:17,741 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:17,745 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2020-06-22 09:26:17,745 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2020-06-22 09:26:18,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:18,145 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 09:26:18,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:18,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:18,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:18,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:18,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:18,146 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:18,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:18,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:18,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:18,148 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 09:26:18,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:18,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:18,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:18,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:18,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:18,149 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:18,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:18,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:18,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:18,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:26:18,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:18,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:18,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:18,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:18,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:18,152 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:18,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:18,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:18,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:18,154 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 09:26:18,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 09:26:18,155 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 09:26:18,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:26:18,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:26:18,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:26:18,155 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 09:26:18,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:26:18,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:26:18,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:26:18,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:26:18 BasicIcfg [2020-06-22 09:26:18,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:26:18,166 INFO L168 Benchmark]: Toolchain (without parser) took 39842.44 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 642.8 MB). Free memory was 558.8 MB in the beginning and 488.2 MB in the end (delta: 70.5 MB). Peak memory consumption was 847.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,166 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:26:18,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.46 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 558.8 MB in the beginning and 664.2 MB in the end (delta: -105.5 MB). Peak memory consumption was 31.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.12 ms. Allocated memory is still 700.4 MB. Free memory was 664.2 MB in the beginning and 662.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,168 INFO L168 Benchmark]: Boogie Preprocessor took 46.78 ms. Allocated memory is still 700.4 MB. Free memory was 662.1 MB in the beginning and 659.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,168 INFO L168 Benchmark]: RCFGBuilder took 341.98 ms. Allocated memory is still 700.4 MB. Free memory was 659.9 MB in the beginning and 638.9 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,168 INFO L168 Benchmark]: BlockEncodingV2 took 119.81 ms. Allocated memory is still 700.4 MB. Free memory was 638.9 MB in the beginning and 629.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,169 INFO L168 Benchmark]: TraceAbstraction took 28261.68 ms. Allocated memory was 700.4 MB in the beginning and 994.6 MB in the end (delta: 294.1 MB). Free memory was 629.1 MB in the beginning and 953.1 MB in the end (delta: -324.0 MB). Peak memory consumption was 526.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,169 INFO L168 Benchmark]: BuchiAutomizer took 10701.79 ms. Allocated memory was 994.6 MB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 953.1 MB in the beginning and 488.2 MB in the end (delta: 464.9 MB). Peak memory consumption was 896.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:26:18,173 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 34 edges - StatisticsResult: Encoded RCFG 22 locations, 39 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 321.46 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 558.8 MB in the beginning and 664.2 MB in the end (delta: -105.5 MB). Peak memory consumption was 31.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.12 ms. Allocated memory is still 700.4 MB. Free memory was 664.2 MB in the beginning and 662.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 46.78 ms. Allocated memory is still 700.4 MB. Free memory was 662.1 MB in the beginning and 659.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 341.98 ms. Allocated memory is still 700.4 MB. Free memory was 659.9 MB in the beginning and 638.9 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.81 ms. Allocated memory is still 700.4 MB. Free memory was 638.9 MB in the beginning and 629.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 28261.68 ms. Allocated memory was 700.4 MB in the beginning and 994.6 MB in the end (delta: 294.1 MB). Free memory was 629.1 MB in the beginning and 953.1 MB in the end (delta: -324.0 MB). Peak memory consumption was 526.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 10701.79 ms. Allocated memory was 994.6 MB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 953.1 MB in the beginning and 488.2 MB in the end (delta: 464.9 MB). Peak memory consumption was 896.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2020-06-22 09:26:18,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((s1 <= p && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && \valid[p] == 1) && 1 <= p) && 1 <= length2) && s2 == 0) && nondetString1 == 0) && p <= s1) && 1 == \valid[spanp]) && 0 == c) && 1 == \valid[nondetString2]) && 1 <= spanp) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && !(0 == sc)) && spanp + 1 <= unknown-#length-unknown[spanp]) && 1 <= unknown-#length-unknown[s2]) && 1 == length1) && 1 == \valid[nondetString1]) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 1 == \valid[s2]) && nondetString2 == 0) || ((((((p + 1 <= unknown-#length-unknown[p] || 0 == c) && ((((((((((((((((((((s1 <= p && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && 1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= unknown-#length-unknown[spanp]) && 1 <= length1) && 1 == \valid[nondetString1]) && p <= s1) && 1 == \valid[s2]) && 1 == \valid[spanp]) && 1 == \valid[nondetString2]) && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && 0 == spanp) && nondetString2 == 0) && unknown-#length-unknown[nondetString2] == length2) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) || (((((s2 == 0 && 0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1]) && nondetString2 == 0) && unknown-#length-unknown[nondetString2] == length2) && ((((((((((((s1 <= p && 1 <= spanp) && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && 1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 1 == \valid[s2]) && p <= s1) && 1 == \valid[spanp]) && 1 == \valid[nondetString2]) && spanp + 1 <= unknown-#length-unknown[spanp])) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && p <= unknown-#length-unknown[p]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p)))) || ((((((((((((((((((((((s1 <= p && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && \valid[p] == 1) && 1 <= p) && 1 <= length2) && s2 == 0) && 1 <= unknown-#length-unknown[spanp]) && nondetString1 == 0) && p <= s1) && 1 == \valid[spanp]) && 0 == c) && 1 == \valid[nondetString2]) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 <= unknown-#length-unknown[s2]) && 1 == length1) && 1 == \valid[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 1 == \valid[s2]) && 0 == spanp) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && spanp <= ULTIMATE.start_main_~nondetString2~0.offset) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 09:26:18,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:26:18,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:26:18,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:26:18,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:26:18,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((s2 == 0 && nondetString2 == 0) && ((((((((((((((s1 <= p && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[p]) && !(nondetString1 == nondetString2)) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && \valid[p] == 1) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && unknown-#memory_int-unknown[p][p] == 0) && 1 == length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && p <= s1) && 1 == \valid[s2]) && 0 == p) && 1 == \valid[nondetString2]) && unknown-#length-unknown[nondetString2] == length2) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) || ((((((((((((((((((((s1 <= p && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[p]) && unknown-#length-unknown[nondetString2] == length2) && \valid[p] == 1) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (s2 <= ULTIMATE.start_main_~nondetString2~0.offset && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 1 == \valid[s2]) && p <= s1) && 1 == \valid[nondetString2]) && nondetString1 == 0) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && 0 == p) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p)))) || (((((((((0 == unknown-#memory_int-unknown[spanp][unknown-#length-unknown[spanp] + -1] && ((((((((((((((s1 <= p && 1 <= spanp) && length1 == unknown-#length-unknown[nondetString1]) && \valid[p] == 1) && 1 <= p) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && p <= s1) && nondetString2 == 0) && 1 == \valid[spanp]) && 1 == \valid[nondetString2]) && unknown-#length-unknown[nondetString2] == length2) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && spanp + 1 <= unknown-#length-unknown[spanp]) && p + 1 <= unknown-#length-unknown[p]) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == p))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 9 error locations. SAFE Result, 28.0s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 6.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 158 SDtfs, 1648 SDslu, 1119 SDs, 0 SdLazy, 3155 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2659 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=21, 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: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 202 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 60 NumberOfFragments, 924 HoareAnnotationTreeSize, 2 FomulaSimplifications, 242250 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 2 FomulaSimplificationsInter, 255405 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 370 ConstructedInterpolants, 32 QuantifiedInterpolants, 75670 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 31 InterpolantComputations, 15 PerfectInterpolantSequences, 18/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic) and one module whose termination is unknown.One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 9.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 110 SDslu, 243 SDs, 0 SdLazy, 359 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn1 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax100 hnf100 lsp97 ukn75 mio100 lsp45 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 6 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Unable to decide termination Buchi Automizer is unable to decide termination for the following lasso. Stem: "[140] ULTIMATE.startENTRY-->L32: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_~length2~0]" "[92] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[]" "[93] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[]" "[111] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset]" "[61] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int]" "[141] L40-1-->L25: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_5) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrspn_~s1.offset_4 v_ULTIMATE.start_cstrspn_~p~0.offset_6) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrspn_~p~0.base_7 v_ULTIMATE.start_cstrspn_~s1.base_5) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_6, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_6, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_6|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_4|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_4, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_8|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_6, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_7|, #length=|v_#length_12|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_7|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_6, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~p~0.offset, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, #memory_int, ULTIMATE.start_cstrspn_#in~s1.base, ULTIMATE.start_cstrspn_~s2.base]" "[72] L25-->L22: Formula: (and (= |v_ULTIMATE.start_cstrspn_#t~post0.base_2| v_ULTIMATE.start_cstrspn_~p~0.base_4) (= |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| v_ULTIMATE.start_cstrspn_~p~0.offset_4) (= v_ULTIMATE.start_cstrspn_~p~0.base_3 |v_ULTIMATE.start_cstrspn_#t~post0.base_2|) (= v_ULTIMATE.start_cstrspn_~p~0.offset_3 (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_4, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_4} OutVars{ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_2|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_2|, ULTIMATE.start_cstrspn_~p~0.base=v_ULTIMATE.start_cstrspn_~p~0.base_3, ULTIMATE.start_cstrspn_~p~0.offset=v_ULTIMATE.start_cstrspn_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~p~0.base, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_~p~0.offset]" "[142] L22-->L23-5: Formula: (and (= v_ULTIMATE.start_cstrspn_~s2.base_5 v_ULTIMATE.start_cstrspn_~spanp~0.base_7) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|) |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) v_ULTIMATE.start_cstrspn_~c~0_7) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|)) (= v_ULTIMATE.start_cstrspn_~s2.offset_5 v_ULTIMATE.start_cstrspn_~spanp~0.offset_7) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrspn_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_9|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_8|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_5, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, #valid=|v_#valid_20|, ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_7, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_8|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_7, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, #length=|v_#length_13|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_7|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~spanp~0.base, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~post0.offset]" "[76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base]" "[143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3]" "[136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3]" "[138] L24-->L23-5: Formula: (> v_ULTIMATE.start_cstrspn_~sc~0_7 v_ULTIMATE.start_cstrspn_~c~0_5) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} AuxVars[] AssignedVars[]" "[76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base]" Loop: "[143] L23-1-->L23-3: Formula: (and (= (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|) |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|) |v_ULTIMATE.start_cstrspn_#t~mem3_7|) (= |v_ULTIMATE.start_cstrspn_#t~mem3_7| v_ULTIMATE.start_cstrspn_~sc~0_9) (<= (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (= 1 (select |v_#valid_21| |v_ULTIMATE.start_cstrspn_#t~post2.base_9|)) (<= 0 |v_ULTIMATE.start_cstrspn_#t~post2.offset_8|)) InVars {ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_8|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_9, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc~0, ULTIMATE.start_cstrspn_#t~mem3]" "[136] L23-3-->L24: Formula: (< 0 v_ULTIMATE.start_cstrspn_~sc~0_5) InVars {ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5} OutVars{ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_5, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_#t~mem3]" "[138] L24-->L23-5: Formula: (> v_ULTIMATE.start_cstrspn_~sc~0_7 v_ULTIMATE.start_cstrspn_~c~0_5) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} OutVars{ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_5, ULTIMATE.start_cstrspn_~sc~0=v_ULTIMATE.start_cstrspn_~sc~0_7} AuxVars[] AssignedVars[]" "[76] L23-5-->L23-1: Formula: (and (= v_ULTIMATE.start_cstrspn_~spanp~0.base_4 |v_ULTIMATE.start_cstrspn_#t~post2.base_2|) (= v_ULTIMATE.start_cstrspn_~spanp~0.offset_4 (+ |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrspn_#t~post2.base_2| v_ULTIMATE.start_cstrspn_~spanp~0.base_5) (= |v_ULTIMATE.start_cstrspn_#t~post2.offset_2| v_ULTIMATE.start_cstrspn_~spanp~0.offset_5)) InVars {ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_5, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_5} OutVars{ULTIMATE.start_cstrspn_~spanp~0.offset=v_ULTIMATE.start_cstrspn_~spanp~0.offset_4, ULTIMATE.start_cstrspn_~spanp~0.base=v_ULTIMATE.start_cstrspn_~spanp~0.base_4, ULTIMATE.start_cstrspn_#t~post2.offset=|v_ULTIMATE.start_cstrspn_#t~post2.offset_2|, ULTIMATE.start_cstrspn_#t~post2.base=|v_ULTIMATE.start_cstrspn_#t~post2.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~post2.offset, ULTIMATE.start_cstrspn_#t~post2.base, ULTIMATE.start_cstrspn_~spanp~0.offset, ULTIMATE.start_cstrspn_~spanp~0.base]" RESULT: Ultimate could not prove your program: unable to determine termination !SESSION 2020-06-22 09:25:35.124 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:26:18.466 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check