YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 11:12:37,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 11:12:37,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 11:12:38,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 11:12:38,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 11:12:38,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 11:12:38,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 11:12:38,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 11:12:38,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 11:12:38,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 11:12:38,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 11:12:38,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 11:12:38,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 11:12:38,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 11:12:38,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 11:12:38,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 11:12:38,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 11:12:38,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 11:12:38,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 11:12:38,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 11:12:38,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 11:12:38,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 11:12:38,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 11:12:38,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 11:12:38,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 11:12:38,031 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 11:12:38,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 11:12:38,032 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 11:12:38,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 11:12:38,033 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 11:12:38,034 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 11:12:38,035 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 11:12:38,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 11:12:38,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 11:12:38,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 11:12:38,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 11:12:38,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 11:12:38,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 11:12:38,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 11:12:38,038 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 11:12:38,053 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 11:12:38,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 11:12:38,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 11:12:38,054 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 11:12:38,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 11:12:38,054 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:12:38,055 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 11:12:38,055 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 11:12:38,055 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 11:12:38,055 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 11:12:38,055 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 11:12:38,056 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 11:12:38,056 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 11:12:38,056 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 11:12:38,056 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 11:12:38,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 11:12:38,056 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 11:12:38,057 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 11:12:38,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 11:12:38,057 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 11:12:38,057 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 11:12:38,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 11:12:38,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 11:12:38,058 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 11:12:38,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 11:12:38,058 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 11:12:38,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 11:12:38,058 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 11:12:38,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 11:12:38,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 11:12:38,097 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 11:12:38,100 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 11:12:38,101 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 11:12:38,102 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 11:12:38,102 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 11:12:38,166 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ca9f492801cc498aa908ad117bf38c7b/FLAGb4d29226f [2020-06-22 11:12:38,512 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 11:12:38,513 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 11:12:38,513 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 11:12:38,520 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ca9f492801cc498aa908ad117bf38c7b/FLAGb4d29226f [2020-06-22 11:12:38,896 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ca9f492801cc498aa908ad117bf38c7b [2020-06-22 11:12:38,907 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 11:12:38,908 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 11:12:38,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 11:12:38,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 11:12:38,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 11:12:38,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:12:38" (1/1) ... [2020-06-22 11:12:38,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d6fffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:38, skipping insertion in model container [2020-06-22 11:12:38,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:12:38" (1/1) ... [2020-06-22 11:12:38,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 11:12:38,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 11:12:39,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:12:39,118 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 11:12:39,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:12:39,212 INFO L195 MainTranslator]: Completed translation [2020-06-22 11:12:39,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39 WrapperNode [2020-06-22 11:12:39,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 11:12:39,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 11:12:39,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 11:12:39,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 11:12:39,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 11:12:39,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 11:12:39,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 11:12:39,253 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 11:12:39,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 11:12:39,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 11:12:39,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 11:12:39,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 11:12:39,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (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 11:12:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 11:12:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 11:12:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 11:12:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 11:12:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 11:12:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 11:12:39,631 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 11:12:39,631 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 11:12:39,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:39 BoogieIcfgContainer [2020-06-22 11:12:39,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 11:12:39,633 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 11:12:39,634 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 11:12:39,636 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 11:12:39,637 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:39" (1/1) ... [2020-06-22 11:12:39,658 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 63 edges [2020-06-22 11:12:39,659 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 11:12:39,660 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 11:12:39,661 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 11:12:39,661 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:12:39,663 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 11:12:39,663 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 11:12:39,664 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 11:12:39,700 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 11:12:39,736 INFO L200 BlockEncoder]: SBE split 31 edges [2020-06-22 11:12:39,741 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 11:12:39,743 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:12:39,786 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-06-22 11:12:39,789 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 11:12:39,790 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 11:12:39,790 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:12:39,791 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 11:12:39,791 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 11:12:39,792 INFO L313 BlockEncoder]: Encoded RCFG 48 locations, 86 edges [2020-06-22 11:12:39,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:12:39 BasicIcfg [2020-06-22 11:12:39,793 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 11:12:39,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 11:12:39,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 11:12:39,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 11:12:39,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 11:12:38" (1/4) ... [2020-06-22 11:12:39,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1c6aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:12:39, skipping insertion in model container [2020-06-22 11:12:39,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (2/4) ... [2020-06-22 11:12:39,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1c6aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:12:39, skipping insertion in model container [2020-06-22 11:12:39,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:39" (3/4) ... [2020-06-22 11:12:39,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1c6aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:12:39, skipping insertion in model container [2020-06-22 11:12:39,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:12:39" (4/4) ... [2020-06-22 11:12:39,801 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:12:39,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 11:12:39,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-06-22 11:12:39,835 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-06-22 11:12:39,864 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:12:39,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 11:12:39,865 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 11:12:39,865 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:12:39,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:12:39,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:12:39,865 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 11:12:39,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:12:39,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 11:12:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-06-22 11:12:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:12:39,887 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:12:39,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:12:39,889 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 11:12:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash 151003, now seen corresponding path program 1 times [2020-06-22 11:12:39,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:40,066 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 11:12:40,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:40,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:12:40,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:12:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:40,089 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-06-22 11:12:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:40,269 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2020-06-22 11:12:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:40,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:12:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:12:40,285 INFO L225 Difference]: With dead ends: 48 [2020-06-22 11:12:40,285 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 11:12:40,288 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 11:12:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 11:12:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-06-22 11:12:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 11:12:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-06-22 11:12:40,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 3 [2020-06-22 11:12:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:12:40,330 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-06-22 11:12:40,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:12:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. [2020-06-22 11:12:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:12:40,331 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:12:40,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:12:40,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 11:12:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash 151005, now seen corresponding path program 1 times [2020-06-22 11:12:40,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:40,353 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 11:12:40,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:40,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:12:40,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:12:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:40,356 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 3 states. [2020-06-22 11:12:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:40,459 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2020-06-22 11:12:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:40,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:12:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:12:40,461 INFO L225 Difference]: With dead ends: 48 [2020-06-22 11:12:40,461 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 11:12:40,462 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 11:12:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 11:12:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-06-22 11:12:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 11:12:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-06-22 11:12:40,468 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 3 [2020-06-22 11:12:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:12:40,469 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-06-22 11:12:40,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:12:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-06-22 11:12:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:12:40,469 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:12:40,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:12:40,470 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 11:12:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 151006, now seen corresponding path program 1 times [2020-06-22 11:12:40,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:40,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:40,510 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 11:12:40,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:40,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:12:40,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:12:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:40,512 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 3 states. [2020-06-22 11:12:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:40,590 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2020-06-22 11:12:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:40,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:12:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:12:40,592 INFO L225 Difference]: With dead ends: 41 [2020-06-22 11:12:40,592 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 11:12:40,593 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 11:12:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 11:12:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 11:12:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 11:12:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2020-06-22 11:12:40,597 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 58 transitions. Word has length 3 [2020-06-22 11:12:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:12:40,598 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 58 transitions. [2020-06-22 11:12:40,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:12:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 58 transitions. [2020-06-22 11:12:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 11:12:40,598 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:12:40,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 11:12:40,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 11:12:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash 202500096, now seen corresponding path program 1 times [2020-06-22 11:12:40,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:40,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:40,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:40,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:40,645 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 11:12:40,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:40,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:12:40,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:12:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:40,646 INFO L87 Difference]: Start difference. First operand 34 states and 58 transitions. Second operand 3 states. [2020-06-22 11:12:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:40,729 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2020-06-22 11:12:40,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:40,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 11:12:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:12:40,731 INFO L225 Difference]: With dead ends: 34 [2020-06-22 11:12:40,731 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 11:12:40,731 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 11:12:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 11:12:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 11:12:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 11:12:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2020-06-22 11:12:40,736 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 46 transitions. Word has length 6 [2020-06-22 11:12:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:12:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 46 transitions. [2020-06-22 11:12:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:12:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 46 transitions. [2020-06-22 11:12:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 11:12:40,737 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:12:40,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 11:12:40,738 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 11:12:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 202500098, now seen corresponding path program 1 times [2020-06-22 11:12:40,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:40,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:40,761 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 11:12:40,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:40,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:12:40,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:12:40,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:40,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:40,762 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand 3 states. [2020-06-22 11:12:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:40,840 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-06-22 11:12:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:40,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 11:12:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:12:40,842 INFO L225 Difference]: With dead ends: 34 [2020-06-22 11:12:40,842 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 11:12:40,842 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 11:12:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 11:12:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 11:12:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 11:12:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-06-22 11:12:40,846 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 6 [2020-06-22 11:12:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:12:40,846 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-06-22 11:12:40,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:12:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-06-22 11:12:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 11:12:40,847 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:12:40,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 11:12:40,847 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION]=== [2020-06-22 11:12:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 202500099, now seen corresponding path program 1 times [2020-06-22 11:12:40,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:40,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:40,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 11:12:40,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:40,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:12:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:12:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:40,880 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 3 states. [2020-06-22 11:12:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:40,929 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-06-22 11:12:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:40,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 11:12:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:12:40,930 INFO L225 Difference]: With dead ends: 28 [2020-06-22 11:12:40,930 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 11:12:40,931 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 11:12:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 11:12:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 11:12:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 11:12:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 11:12:40,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-06-22 11:12:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:12:40,932 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:12:40,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:12:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:12:40,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 11:12:40,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 11:12:40,960 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 11:12:40,960 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 11:12:40,961 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 11:12:40,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point L8-6(lines 8 24) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 11:12:40,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 11:12:40,964 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 22) no Hoare annotation was computed. [2020-06-22 11:12:40,965 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 8 24) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) [2020-06-22 11:12:40,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 23) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 15) no Hoare annotation was computed. [2020-06-22 11:12:40,966 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 11:12:40,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,967 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 11:12:40,967 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 11:12:40,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:12:40,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:12:40,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:12:40,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:12:40,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:12:40 BasicIcfg [2020-06-22 11:12:40,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 11:12:40,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 11:12:40,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 11:12:40,989 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 11:12:40,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:12:40,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 11:12:38" (1/5) ... [2020-06-22 11:12:40,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bbef407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:12:40, skipping insertion in model container [2020-06-22 11:12:40,991 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:12:40,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:12:39" (2/5) ... [2020-06-22 11:12:40,991 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bbef407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:12:40, skipping insertion in model container [2020-06-22 11:12:40,991 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:12:40,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:12:39" (3/5) ... [2020-06-22 11:12:40,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bbef407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:12:40, skipping insertion in model container [2020-06-22 11:12:40,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:12:40,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:12:39" (4/5) ... [2020-06-22 11:12:40,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bbef407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:12:40, skipping insertion in model container [2020-06-22 11:12:40,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:12:40,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:12:40" (5/5) ... [2020-06-22 11:12:40,994 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:12:41,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:12:41,016 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 11:12:41,016 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 11:12:41,016 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:12:41,016 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:12:41,016 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:12:41,016 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 11:12:41,016 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:12:41,016 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 11:12:41,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2020-06-22 11:12:41,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 11:12:41,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:41,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:41,031 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:41,032 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:41,032 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 11:12:41,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2020-06-22 11:12:41,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 11:12:41,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:41,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:41,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:41,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:41,040 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 18#L-1true [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 31#L17-2true [2020-06-22 11:12:41,041 INFO L796 eck$LassoCheckResult]: Loop: 31#L17-2true [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 37#L8-1true [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 34#L8-2true [115] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 47#L8-6true [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 16#L9true [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 11#L9-1true [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 35#L17true [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 10#L18true [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 6#L18-1true [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 31#L17-2true [2020-06-22 11:12:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 1 times [2020-06-22 11:12:41,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 240931134, now seen corresponding path program 1 times [2020-06-22 11:12:41,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:41,091 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 11:12:41,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:41,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 11:12:41,092 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:12:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:41,094 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-06-22 11:12:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:41,229 INFO L93 Difference]: Finished difference Result 50 states and 88 transitions. [2020-06-22 11:12:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:41,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 88 transitions. [2020-06-22 11:12:41,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 11:12:41,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 24 states and 36 transitions. [2020-06-22 11:12:41,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-06-22 11:12:41,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 11:12:41,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. [2020-06-22 11:12:41,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:12:41,238 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-06-22 11:12:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. [2020-06-22 11:12:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-06-22 11:12:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 11:12:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-06-22 11:12:41,241 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-06-22 11:12:41,241 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-06-22 11:12:41,241 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 11:12:41,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-06-22 11:12:41,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 11:12:41,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:41,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:41,243 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:41,243 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:41,243 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 122#L-1 [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 107#L17-2 [2020-06-22 11:12:41,244 INFO L796 eck$LassoCheckResult]: Loop: 107#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 108#L8-1 [194] L8-1-->L8-2: Formula: (and (not |v_ULTIMATE.start_main_#t~short4_2|) (= |v_ULTIMATE.start_main_#t~mem2_3| 0)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 116#L8-2 [115] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 128#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 121#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 117#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 112#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 113#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 115#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 107#L17-2 [2020-06-22 11:12:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 2 times [2020-06-22 11:12:41,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:41,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash -568415492, now seen corresponding path program 1 times [2020-06-22 11:12:41,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:41,274 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 11:12:41,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:41,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 11:12:41,275 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:12:41,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:12:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:12:41,276 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-06-22 11:12:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:41,308 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2020-06-22 11:12:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:12:41,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2020-06-22 11:12:41,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 11:12:41,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2020-06-22 11:12:41,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 11:12:41,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 11:12:41,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2020-06-22 11:12:41,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:12:41,311 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 11:12:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2020-06-22 11:12:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 11:12:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 11:12:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-06-22 11:12:41,313 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 11:12:41,313 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 11:12:41,313 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 11:12:41,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-06-22 11:12:41,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 11:12:41,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:41,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:41,315 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:41,315 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:41,316 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 174#L-1 [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 160#L17-2 [2020-06-22 11:12:41,316 INFO L796 eck$LassoCheckResult]: Loop: 160#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 161#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 164#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 162#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 163#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 180#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 173#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 169#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 165#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 166#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 168#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 160#L17-2 [2020-06-22 11:12:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 3 times [2020-06-22 11:12:41,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:41,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 939896181, now seen corresponding path program 1 times [2020-06-22 11:12:41,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2120264338, now seen corresponding path program 1 times [2020-06-22 11:12:41,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:41,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:41,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:41,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:41,607 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:41,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:41,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:41,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:41,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:41,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:41,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:41,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:41,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 11:12:41,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:41,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:41,627 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 11:12:41,633 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 11:12:41,636 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 11:12:41,642 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 11:12:41,644 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 11:12:41,646 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 11:12:41,649 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 11:12:41,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:41,653 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 11:12:41,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:41,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:41,876 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 11:12:41,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:41,879 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 11:12:41,881 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 11:12:41,882 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 11:12:42,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:42,143 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:42,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 11:12:42,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:42,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,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 11:12:42,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:42,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,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 11:12:42,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:42,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:42,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:42,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:42,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:42,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:42,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:42,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:42,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:42,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:42,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:42,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:42,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:42,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:42,181 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:42,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:42,185 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:42,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:42,187 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 11:12:42,187 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:42,188 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2020-06-22 11:12:42,214 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:42,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:42,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:42,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:42,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:42,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:42,304 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 11:12:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:42,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:42,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:42,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2020-06-22 11:12:42,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:42,464 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:42,465 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:42,465 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 11:12:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:42,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:42,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:42,535 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2020-06-22 11:12:42,536 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:42,547 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:42,547 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:42,548 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 11:12:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:42,565 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:42,565 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 11:12:42,569 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 11:12:42,570 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 31 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 11:12:42,922 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 31 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 128 states and 163 transitions. Complement of second has 21 states. [2020-06-22 11:12:42,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 9 non-accepting loop states 2 accepting loop states [2020-06-22 11:12:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 11:12:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2020-06-22 11:12:42,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 93 transitions. Stem has 2 letters. Loop has 11 letters. [2020-06-22 11:12:42,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:42,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 93 transitions. Stem has 13 letters. Loop has 11 letters. [2020-06-22 11:12:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:42,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 93 transitions. Stem has 2 letters. Loop has 22 letters. [2020-06-22 11:12:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:42,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 163 transitions. [2020-06-22 11:12:42,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2020-06-22 11:12:42,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 105 states and 136 transitions. [2020-06-22 11:12:42,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2020-06-22 11:12:42,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-06-22 11:12:42,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 136 transitions. [2020-06-22 11:12:42,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:42,941 INFO L706 BuchiCegarLoop]: Abstraction has 105 states and 136 transitions. [2020-06-22 11:12:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 136 transitions. [2020-06-22 11:12:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2020-06-22 11:12:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-06-22 11:12:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2020-06-22 11:12:42,946 INFO L729 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2020-06-22 11:12:42,946 INFO L609 BuchiCegarLoop]: Abstraction has 65 states and 86 transitions. [2020-06-22 11:12:42,946 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 11:12:42,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 86 transitions. [2020-06-22 11:12:42,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2020-06-22 11:12:42,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:42,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:42,949 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:42,949 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:42,950 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 544#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 514#L17-2 [2020-06-22 11:12:42,950 INFO L796 eck$LassoCheckResult]: Loop: 514#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 515#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 570#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 578#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 577#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 576#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 575#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 574#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 537#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 548#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 553#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 514#L17-2 [2020-06-22 11:12:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2020-06-22 11:12:42,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:42,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:42,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 938868373, now seen corresponding path program 1 times [2020-06-22 11:12:42,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:42,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:43,000 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 11:12:43,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:43,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 11:12:43,001 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:12:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 11:12:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 11:12:43,001 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. cyclomatic complexity: 24 Second operand 5 states. [2020-06-22 11:12:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:43,114 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2020-06-22 11:12:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 11:12:43,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 98 transitions. [2020-06-22 11:12:43,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2020-06-22 11:12:43,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 98 transitions. [2020-06-22 11:12:43,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-06-22 11:12:43,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-06-22 11:12:43,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 98 transitions. [2020-06-22 11:12:43,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:43,122 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-06-22 11:12:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 98 transitions. [2020-06-22 11:12:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2020-06-22 11:12:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-06-22 11:12:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2020-06-22 11:12:43,127 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. [2020-06-22 11:12:43,127 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. [2020-06-22 11:12:43,127 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 11:12:43,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 91 transitions. [2020-06-22 11:12:43,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:43,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:43,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:43,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:43,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:43,129 INFO L794 eck$LassoCheckResult]: Stem: 708#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 701#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 683#L17-2 [2020-06-22 11:12:43,129 INFO L796 eck$LassoCheckResult]: Loop: 683#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 724#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 732#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 731#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 730#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 729#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 728#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 715#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 705#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 706#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 712#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 683#L17-2 [2020-06-22 11:12:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 2 times [2020-06-22 11:12:43,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:43,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash 742354868, now seen corresponding path program 1 times [2020-06-22 11:12:43,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:43,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:43,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:43,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:43,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1793640306, now seen corresponding path program 1 times [2020-06-22 11:12:43,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:43,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:43,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:43,397 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:43,398 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:43,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:43,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:43,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:43,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:43,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:43,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:43,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 11:12:43,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:43,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:43,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:43,405 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 11:12:43,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:43,410 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 11:12:43,413 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 11:12:43,415 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 11:12:43,418 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 11:12:43,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:43,423 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 11:12:43,426 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 11:12:43,614 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 11:12:43,617 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 11:12:43,619 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 11:12:43,621 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 11:12:43,623 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 11:12:43,625 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 11:12:43,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:43,855 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:43,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 11:12:43,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:43,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:43,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:43,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,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 11:12:43,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:43,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:43,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:43,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:43,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:43,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:43,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,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 11:12:43,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,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 11:12:43,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,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 11:12:43,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:43,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:43,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:43,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:43,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:43,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:43,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:43,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:43,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:43,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:43,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:43,898 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:43,900 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:43,900 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:43,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:43,900 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 11:12:43,901 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:43,901 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2020-06-22 11:12:43,923 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:43,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:43,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:43,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:43,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:43,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:43,985 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 11:12:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,044 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:44,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:44,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:44,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 11:12:44,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:44,077 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:44,078 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:44,078 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 11:12:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,130 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:44,130 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 11:12:44,131 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 11:12:44,131 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 71 states and 91 transitions. cyclomatic complexity: 23 Second operand 6 states. [2020-06-22 11:12:44,269 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 71 states and 91 transitions. cyclomatic complexity: 23. Second operand 6 states. Result 119 states and 149 transitions. Complement of second has 12 states. [2020-06-22 11:12:44,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 11:12:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 11:12:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2020-06-22 11:12:44,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 11 letters. [2020-06-22 11:12:44,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:44,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 13 letters. Loop has 11 letters. [2020-06-22 11:12:44,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:44,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 22 letters. [2020-06-22 11:12:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:44,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 149 transitions. [2020-06-22 11:12:44,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:44,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 104 states and 131 transitions. [2020-06-22 11:12:44,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-06-22 11:12:44,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-06-22 11:12:44,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 131 transitions. [2020-06-22 11:12:44,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:44,280 INFO L706 BuchiCegarLoop]: Abstraction has 104 states and 131 transitions. [2020-06-22 11:12:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 131 transitions. [2020-06-22 11:12:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2020-06-22 11:12:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-06-22 11:12:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2020-06-22 11:12:44,285 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-06-22 11:12:44,285 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-06-22 11:12:44,285 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 11:12:44,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 116 transitions. [2020-06-22 11:12:44,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:44,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:44,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:44,287 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:44,287 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:44,287 INFO L794 eck$LassoCheckResult]: Stem: 1054#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1045#L-1 [185] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1028#L17-2 [2020-06-22 11:12:44,287 INFO L796 eck$LassoCheckResult]: Loop: 1028#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1094#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1095#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1089#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1090#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1079#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1080#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1068#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1066#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 1062#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1059#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1028#L17-2 [2020-06-22 11:12:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 4866, now seen corresponding path program 1 times [2020-06-22 11:12:44,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:44,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:44,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash 742354868, now seen corresponding path program 2 times [2020-06-22 11:12:44,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:44,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:44,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1664557587, now seen corresponding path program 1 times [2020-06-22 11:12:44,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:44,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:44,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:44,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:44,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:44,533 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:44,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:44,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:44,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:44,534 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:44,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:44,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:44,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:44,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 11:12:44,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:44,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:44,538 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 11:12:44,540 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 11:12:44,542 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 11:12:44,544 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 11:12:44,545 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 11:12:44,547 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 11:12:44,549 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 11:12:44,550 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 11:12:44,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:44,554 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 11:12:44,712 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 11:12:44,714 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 11:12:44,716 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 11:12:44,718 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 11:12:44,719 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 11:12:44,721 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 11:12:44,945 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:44,945 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:44,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,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 11:12:44,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:44,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:44,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:44,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:44,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:44,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:44,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:44,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:44,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:44,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:44,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:44,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:44,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:44,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:44,972 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:44,972 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:44,973 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:44,973 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 11:12:44,973 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:44,973 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 Supporting invariants [] [2020-06-22 11:12:44,998 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:44,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:45,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:45,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:45,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:12:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,188 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:45,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:45,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:45,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 11:12:45,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:45,240 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:45,241 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:45,241 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 11:12:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,306 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:45,306 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 11:12:45,307 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 11:12:45,307 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29 Second operand 6 states. [2020-06-22 11:12:45,457 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29. Second operand 6 states. Result 139 states and 174 transitions. Complement of second has 12 states. [2020-06-22 11:12:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 11:12:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 11:12:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2020-06-22 11:12:45,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 11 letters. [2020-06-22 11:12:45,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:45,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 13 letters. Loop has 11 letters. [2020-06-22 11:12:45,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:45,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 22 letters. [2020-06-22 11:12:45,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:45,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2020-06-22 11:12:45,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:45,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 124 states and 156 transitions. [2020-06-22 11:12:45,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2020-06-22 11:12:45,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-06-22 11:12:45,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 156 transitions. [2020-06-22 11:12:45,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:45,470 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 156 transitions. [2020-06-22 11:12:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 156 transitions. [2020-06-22 11:12:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2020-06-22 11:12:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-06-22 11:12:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2020-06-22 11:12:45,474 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-06-22 11:12:45,475 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-06-22 11:12:45,475 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 11:12:45,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 116 transitions. [2020-06-22 11:12:45,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:45,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:45,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:45,476 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 11:12:45,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:45,477 INFO L794 eck$LassoCheckResult]: Stem: 1434#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1425#L-1 [184] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1426#L17-2 [2020-06-22 11:12:45,477 INFO L796 eck$LassoCheckResult]: Loop: 1426#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1466#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1467#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1487#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1486#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1485#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1484#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1444#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1443#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 1440#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1437#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 1426#L17-2 [2020-06-22 11:12:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 4865, now seen corresponding path program 1 times [2020-06-22 11:12:45,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:45,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash 742354868, now seen corresponding path program 3 times [2020-06-22 11:12:45,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:45,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:45,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:45,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:45,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1535474868, now seen corresponding path program 1 times [2020-06-22 11:12:45,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:45,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:45,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:45,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:45,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:45,701 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:45,702 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:45,702 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:45,702 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:45,702 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:45,702 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:45,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:45,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:45,703 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-06-22 11:12:45,703 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:45,703 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:45,705 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 11:12:45,708 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 11:12:45,710 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 11:12:45,712 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 11:12:45,714 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 11:12:45,715 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 11:12:45,717 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 11:12:45,719 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 11:12:45,720 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 11:12:45,722 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 11:12:45,723 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 11:12:45,725 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 11:12:45,726 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 11:12:45,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:45,925 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 11:12:45,928 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 11:12:46,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:46,173 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:46,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,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 11:12:46,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,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 11:12:46,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,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 11:12:46,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,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 11:12:46,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,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 11:12:46,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:46,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:46,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:46,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:46,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:46,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:46,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:46,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:46,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:46,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:46,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:46,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:46,259 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:46,259 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:46,260 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:46,260 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 11:12:46,260 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:46,260 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2020-06-22 11:12:46,285 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:46,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:46,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:46,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:46,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:46,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:12:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,403 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:46,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:46,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 11:12:46,433 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:46,437 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:46,438 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:46,439 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 11:12:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,494 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:46,494 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 11:12:46,494 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 11:12:46,494 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29 Second operand 6 states. [2020-06-22 11:12:46,610 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29. Second operand 6 states. Result 139 states and 174 transitions. Complement of second has 12 states. [2020-06-22 11:12:46,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 11:12:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 11:12:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2020-06-22 11:12:46,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 11 letters. [2020-06-22 11:12:46,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:46,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 13 letters. Loop has 11 letters. [2020-06-22 11:12:46,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:46,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 53 transitions. Stem has 2 letters. Loop has 22 letters. [2020-06-22 11:12:46,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:46,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2020-06-22 11:12:46,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:46,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 124 states and 156 transitions. [2020-06-22 11:12:46,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2020-06-22 11:12:46,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-06-22 11:12:46,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 156 transitions. [2020-06-22 11:12:46,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:46,619 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 156 transitions. [2020-06-22 11:12:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 156 transitions. [2020-06-22 11:12:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2020-06-22 11:12:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-06-22 11:12:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2020-06-22 11:12:46,623 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-06-22 11:12:46,623 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-06-22 11:12:46,623 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 11:12:46,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 116 transitions. [2020-06-22 11:12:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 11:12:46,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:46,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:46,625 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:46,625 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:46,625 INFO L794 eck$LassoCheckResult]: Stem: 1819#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1811#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1812#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1847#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1790#L8-2 [2020-06-22 11:12:46,626 INFO L796 eck$LassoCheckResult]: Loop: 1790#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1786#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1787#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1820#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1809#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1803#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1804#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 1801#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1796#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 1797#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1858#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1790#L8-2 [2020-06-22 11:12:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 1 times [2020-06-22 11:12:46,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:46,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1490135663, now seen corresponding path program 2 times [2020-06-22 11:12:46,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:46,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:46,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:46,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2029873439, now seen corresponding path program 1 times [2020-06-22 11:12:46,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:46,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:46,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:46,885 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-06-22 11:12:46,938 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:46,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:46,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:46,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:46,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:46,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:46,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:46,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:46,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 11:12:46,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:46,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:46,942 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 11:12:46,948 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 11:12:46,951 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 11:12:46,952 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 11:12:46,954 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 11:12:46,955 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 11:12:46,957 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 11:12:46,959 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 11:12:46,960 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 11:12:47,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 11:12:47,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 11:12:47,163 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 11:12:47,165 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 11:12:47,167 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 11:12:47,168 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 11:12:47,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:47,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:47,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,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 11:12:47,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,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 11:12:47,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:47,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:47,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:47,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,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 11:12:47,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,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 11:12:47,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:47,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:47,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:47,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:47,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:47,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:47,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:47,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:47,530 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:47,534 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:47,534 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:47,535 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:47,536 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:12:47,536 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:47,536 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2020-06-22 11:12:47,571 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:47,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:47,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:47,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:47,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:47,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:47,637 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2020-06-22 11:12:47,638 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:47,644 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 11:12:47,673 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 11:12:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:47,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:47,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:47,708 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2020-06-22 11:12:47,708 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,713 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:47,713 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,714 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 11:12:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:47,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:47,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:47,751 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 18 [2020-06-22 11:12:47,751 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,756 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:47,756 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,756 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 11:12:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:47,770 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:47,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:47,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:47,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:47,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:47,914 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 37 treesize of output 21 [2020-06-22 11:12:47,914 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,921 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:47,922 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:47,922 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2020-06-22 11:12:47,979 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 11:12:47,980 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-06-22 11:12:47,980 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29 Second operand 6 states. [2020-06-22 11:12:48,518 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 91 states and 116 transitions. cyclomatic complexity: 29. Second operand 6 states. Result 537 states and 653 transitions. Complement of second has 132 states. [2020-06-22 11:12:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2020-06-22 11:12:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 11:12:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 110 transitions. [2020-06-22 11:12:48,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 110 transitions. Stem has 4 letters. Loop has 11 letters. [2020-06-22 11:12:48,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:48,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 110 transitions. Stem has 15 letters. Loop has 11 letters. [2020-06-22 11:12:48,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:48,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 110 transitions. Stem has 4 letters. Loop has 22 letters. [2020-06-22 11:12:48,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:48,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 653 transitions. [2020-06-22 11:12:48,529 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 150 [2020-06-22 11:12:48,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 275 states and 335 transitions. [2020-06-22 11:12:48,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2020-06-22 11:12:48,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2020-06-22 11:12:48,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 335 transitions. [2020-06-22 11:12:48,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:48,532 INFO L706 BuchiCegarLoop]: Abstraction has 275 states and 335 transitions. [2020-06-22 11:12:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 335 transitions. [2020-06-22 11:12:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 129. [2020-06-22 11:12:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-06-22 11:12:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2020-06-22 11:12:48,537 INFO L729 BuchiCegarLoop]: Abstraction has 129 states and 166 transitions. [2020-06-22 11:12:48,537 INFO L609 BuchiCegarLoop]: Abstraction has 129 states and 166 transitions. [2020-06-22 11:12:48,537 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 11:12:48,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 166 transitions. [2020-06-22 11:12:48,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-06-22 11:12:48,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:48,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:48,539 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:48,539 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:48,540 INFO L794 eck$LassoCheckResult]: Stem: 2845#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 2836#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 2837#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 2859#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 2870#L8-2 [2020-06-22 11:12:48,540 INFO L796 eck$LassoCheckResult]: Loop: 2870#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 2813#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 2814#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 2846#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 2834#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2830#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 2822#L17 [150] L17-->L20: Formula: (= |v_ULTIMATE.start_main_#t~nondet10_5| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 2823#L20 [138] L20-->L20-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_12 4) (select |v_#length_24| v_ULTIMATE.start_main_~y~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem12_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~y~0.base_16) v_ULTIMATE.start_main_~y~0.offset_12)) (= (select |v_#valid_26| v_ULTIMATE.start_main_~y~0.base_16) 1) (<= 0 v_ULTIMATE.start_main_~y~0.offset_12)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_24|, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 2832#L20-1 [254] L20-1-->L21: Formula: (and (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~y~0.base_23)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_17) (= |v_#memory_int_24| (store |v_#memory_int_25| v_ULTIMATE.start_main_~y~0.base_23 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~y~0.base_23) v_ULTIMATE.start_main_~y~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem12_6| (- 1))))) (<= (+ v_ULTIMATE.start_main_~y~0.offset_17 4) (select |v_#length_32| v_ULTIMATE.start_main_~y~0.base_23))) InVars {ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_23, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_17, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_23, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_17, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12, #memory_int] 2833#L21 [257] L21-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_35| v_ULTIMATE.start_main_~x~0.base_27)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= (select |v_#valid_46| v_ULTIMATE.start_main_~x~0.base_27) 1) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~x~0.base_27 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~x~0.base_27) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet13_5|)) |v_#memory_int_30|)) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_35|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_35|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #memory_int] 2809#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 2810#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 2870#L8-2 [2020-06-22 11:12:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 2 times [2020-06-22 11:12:48,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:48,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash -568421964, now seen corresponding path program 1 times [2020-06-22 11:12:48,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:48,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:48,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash -120423836, now seen corresponding path program 1 times [2020-06-22 11:12:48,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:48,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:48,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:48,799 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-06-22 11:12:48,847 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:48,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:48,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:48,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:48,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:48,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:48,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:48,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:48,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-06-22 11:12:48,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:48,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:48,850 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 11:12:48,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 11:12:48,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 11:12:49,034 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 11:12:49,036 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 11:12:49,037 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 11:12:49,039 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 11:12:49,040 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 11:12:49,042 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 11:12:49,043 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 11:12:49,045 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 11:12:49,047 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 11:12:49,051 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 11:12:49,052 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 11:12:49,323 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:49,323 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:49,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 11:12:49,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:49,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:49,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:49,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:49,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:49,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:49,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:49,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 11:12:49,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:49,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:49,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:49,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:49,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:49,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:49,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:49,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:49,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:49,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:49,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:49,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:49,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:49,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:49,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:49,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:49,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:49,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:49,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:49,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:49,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:49,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:49,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:49,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:49,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:49,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:49,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:49,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:49,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:49,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:49,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:49,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:49,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:49,343 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:49,343 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:49,343 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 11:12:49,343 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:49,343 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2020-06-22 11:12:49,370 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:49,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:49,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:49,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:49,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:49,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:49,509 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:49,510 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 [2020-06-22 11:12:49,518 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,561 INFO L497 ElimStorePlain]: treesize reduction 56, result has 36.4 percent of original size [2020-06-22 11:12:49,561 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,562 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2020-06-22 11:12:49,606 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:49,606 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-06-22 11:12:49,607 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,615 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2020-06-22 11:12:49,616 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,634 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:49,635 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 11:12:49,635 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2020-06-22 11:12:49,650 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 11:12:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:49,770 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:49,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:49,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:49,802 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 11:12:49,803 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,807 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:49,808 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,808 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 11:12:49,824 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:49,824 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2020-06-22 11:12:49,825 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:49,844 INFO L497 ElimStorePlain]: treesize reduction 16, result has 61.0 percent of original size [2020-06-22 11:12:49,844 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 11:12:49,845 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2020-06-22 11:12:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:50,200 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:50,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:50,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:50,226 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:50,226 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2020-06-22 11:12:50,227 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:50,248 INFO L497 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-06-22 11:12:50,248 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 11:12:50,249 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-06-22 11:12:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:50,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:50,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:50,829 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:50,829 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 69 [2020-06-22 11:12:50,835 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:50,880 INFO L497 ElimStorePlain]: treesize reduction 63, result has 35.7 percent of original size [2020-06-22 11:12:50,881 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:50,881 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 [2020-06-22 11:12:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:51,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:51,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:51,044 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:51,044 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 [2020-06-22 11:12:51,051 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:51,095 INFO L497 ElimStorePlain]: treesize reduction 63, result has 34.4 percent of original size [2020-06-22 11:12:51,096 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:51,096 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2020-06-22 11:12:51,111 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2020-06-22 11:12:51,112 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:51,119 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:51,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-06-22 11:12:51,120 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:51,138 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:51,139 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 11:12:51,139 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2020-06-22 11:12:51,166 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 21 predicates after loop cannibalization [2020-06-22 11:12:51,167 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 21 loop predicates [2020-06-22 11:12:51,167 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 129 states and 166 transitions. cyclomatic complexity: 43 Second operand 10 states. [2020-06-22 11:12:54,805 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 129 states and 166 transitions. cyclomatic complexity: 43. Second operand 10 states. Result 878 states and 1075 transitions. Complement of second has 254 states. [2020-06-22 11:12:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 43 states 1 stem states 39 non-accepting loop states 3 accepting loop states [2020-06-22 11:12:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 11:12:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 136 transitions. [2020-06-22 11:12:54,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 136 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 11:12:54,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:54,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 136 transitions. Stem has 16 letters. Loop has 12 letters. [2020-06-22 11:12:54,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:54,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 136 transitions. Stem has 4 letters. Loop has 24 letters. [2020-06-22 11:12:54,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:54,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 878 states and 1075 transitions. [2020-06-22 11:12:54,820 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 217 [2020-06-22 11:12:54,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 878 states to 465 states and 570 transitions. [2020-06-22 11:12:54,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-06-22 11:12:54,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-06-22 11:12:54,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 570 transitions. [2020-06-22 11:12:54,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:54,825 INFO L706 BuchiCegarLoop]: Abstraction has 465 states and 570 transitions. [2020-06-22 11:12:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 570 transitions. [2020-06-22 11:12:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 205. [2020-06-22 11:12:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-06-22 11:12:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2020-06-22 11:12:54,832 INFO L729 BuchiCegarLoop]: Abstraction has 205 states and 263 transitions. [2020-06-22 11:12:54,832 INFO L609 BuchiCegarLoop]: Abstraction has 205 states and 263 transitions. [2020-06-22 11:12:54,832 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 11:12:54,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 263 transitions. [2020-06-22 11:12:54,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 96 [2020-06-22 11:12:54,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:54,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:54,834 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:54,834 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:54,835 INFO L794 eck$LassoCheckResult]: Stem: 4481#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 4471#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 4472#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4496#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4510#L8-2 [2020-06-22 11:12:54,835 INFO L796 eck$LassoCheckResult]: Loop: 4510#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 4445#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4585#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4583#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4581#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4579#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4578#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 4577#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 4568#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 4541#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4540#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4522#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 4521#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4488#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4482#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4467#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4459#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4460#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 4487#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 4484#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 4435#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4436#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 4510#L8-2 [2020-06-22 11:12:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 3 times [2020-06-22 11:12:54,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:54,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:54,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1944589440, now seen corresponding path program 1 times [2020-06-22 11:12:54,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:54,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:54,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:54,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:54,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 11:12:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 11:12:55,052 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:12:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 11:12:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-06-22 11:12:55,053 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. cyclomatic complexity: 66 Second operand 9 states. [2020-06-22 11:12:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:55,457 INFO L93 Difference]: Finished difference Result 261 states and 325 transitions. [2020-06-22 11:12:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 11:12:55,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 325 transitions. [2020-06-22 11:12:55,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 121 [2020-06-22 11:12:55,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 261 states and 325 transitions. [2020-06-22 11:12:55,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2020-06-22 11:12:55,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2020-06-22 11:12:55,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 325 transitions. [2020-06-22 11:12:55,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:55,466 INFO L706 BuchiCegarLoop]: Abstraction has 261 states and 325 transitions. [2020-06-22 11:12:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 325 transitions. [2020-06-22 11:12:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 208. [2020-06-22 11:12:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-06-22 11:12:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2020-06-22 11:12:55,472 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2020-06-22 11:12:55,472 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2020-06-22 11:12:55,472 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 11:12:55,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 266 transitions. [2020-06-22 11:12:55,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 [2020-06-22 11:12:55,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:55,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:55,474 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:55,474 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:55,475 INFO L794 eck$LassoCheckResult]: Stem: 4977#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 4967#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 4968#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5009#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5063#L8-2 [2020-06-22 11:12:55,475 INFO L796 eck$LassoCheckResult]: Loop: 5063#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 4939#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 4940#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5037#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5038#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5033#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5034#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 5029#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5030#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 5025#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5024#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5023#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5022#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5021#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5020#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4962#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4963#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 4989#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 4970#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4973#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4974#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 4933#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 4934#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5063#L8-2 [2020-06-22 11:12:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 4 times [2020-06-22 11:12:55,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:55,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:55,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1094483233, now seen corresponding path program 1 times [2020-06-22 11:12:55,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:55,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:12:55,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:12:55,685 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 11:12:55,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:55,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:12:55,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:55,761 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:55,762 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 15 treesize of output 19 [2020-06-22 11:12:55,763 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 11:12:55,771 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:55,771 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 11:12:55,771 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:12 [2020-06-22 11:12:55,811 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 32 treesize of output 20 [2020-06-22 11:12:55,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:55,816 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 32 treesize of output 20 [2020-06-22 11:12:55,816 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:55,830 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:55,830 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 11:12:55,831 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:25 [2020-06-22 11:12:55,852 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 23 treesize of output 22 [2020-06-22 11:12:55,853 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:55,858 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 23 treesize of output 22 [2020-06-22 11:12:55,858 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:55,871 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:55,872 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 11:12:55,872 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-06-22 11:12:55,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2020-06-22 11:12:55,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:55,877 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:55,877 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 11:12:55,877 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-06-22 11:12:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:12:55,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:12:55,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-06-22 11:12:55,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:12:55,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 11:12:55,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-06-22 11:12:55,908 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. cyclomatic complexity: 66 Second operand 14 states. [2020-06-22 11:12:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:56,297 INFO L93 Difference]: Finished difference Result 273 states and 340 transitions. [2020-06-22 11:12:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 11:12:56,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 340 transitions. [2020-06-22 11:12:56,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 152 [2020-06-22 11:12:56,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 273 states and 340 transitions. [2020-06-22 11:12:56,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-06-22 11:12:56,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-06-22 11:12:56,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 340 transitions. [2020-06-22 11:12:56,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:56,306 INFO L706 BuchiCegarLoop]: Abstraction has 273 states and 340 transitions. [2020-06-22 11:12:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 340 transitions. [2020-06-22 11:12:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 208. [2020-06-22 11:12:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-06-22 11:12:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2020-06-22 11:12:56,312 INFO L729 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2020-06-22 11:12:56,312 INFO L609 BuchiCegarLoop]: Abstraction has 208 states and 266 transitions. [2020-06-22 11:12:56,312 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 11:12:56,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 266 transitions. [2020-06-22 11:12:56,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 [2020-06-22 11:12:56,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:56,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:56,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:56,314 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 11:12:56,314 INFO L794 eck$LassoCheckResult]: Stem: 5570#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 5560#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 5561#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5611#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5652#L8-2 [2020-06-22 11:12:56,315 INFO L796 eck$LassoCheckResult]: Loop: 5652#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5531#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5532#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5650#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5649#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5648#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5645#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 5625#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5619#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 5616#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5615#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5614#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5613#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5578#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5579#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5605#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5585#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5583#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 5577#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5574#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5571#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5646#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5647#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5623#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5624#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5600#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5601#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5595#L9-1 [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5549#L17 [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 5545#L18 [93] L18-->L18-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 5546#L18-1 [255] L18-1-->L17-2: Formula: (and (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1)))) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 5524#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5525#L8-1 [192] L8-1-->L8-2: Formula: (and (< |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5652#L8-2 [2020-06-22 11:12:56,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash 4681905, now seen corresponding path program 5 times [2020-06-22 11:12:56,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:56,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash -335253231, now seen corresponding path program 2 times [2020-06-22 11:12:56,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 11:12:56,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:12:56,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 11:12:56,356 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 11:12:56,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 11:12:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 11:12:56,356 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. cyclomatic complexity: 66 Second operand 5 states. [2020-06-22 11:12:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:12:56,434 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2020-06-22 11:12:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 11:12:56,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 206 transitions. [2020-06-22 11:12:56,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 11:12:56,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 124 states and 149 transitions. [2020-06-22 11:12:56,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-06-22 11:12:56,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-06-22 11:12:56,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 149 transitions. [2020-06-22 11:12:56,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:56,442 INFO L706 BuchiCegarLoop]: Abstraction has 124 states and 149 transitions. [2020-06-22 11:12:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 149 transitions. [2020-06-22 11:12:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2020-06-22 11:12:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-06-22 11:12:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2020-06-22 11:12:56,444 INFO L729 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. [2020-06-22 11:12:56,444 INFO L609 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. [2020-06-22 11:12:56,444 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 11:12:56,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 117 transitions. [2020-06-22 11:12:56,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 11:12:56,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:56,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:56,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:56,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:56,446 INFO L794 eck$LassoCheckResult]: Stem: 5956#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 5945#L-1 [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 5947#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5987#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5932#L8-2 [2020-06-22 11:12:56,446 INFO L796 eck$LassoCheckResult]: Loop: 5932#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 5928#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5929#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5957#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 5942#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5937#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 5938#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 5962#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 5959#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 5924#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 5925#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 5932#L8-2 [2020-06-22 11:12:56,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 4682867, now seen corresponding path program 1 times [2020-06-22 11:12:56,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:56,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1817108146, now seen corresponding path program 4 times [2020-06-22 11:12:56,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:56,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:56,466 INFO L82 PathProgramCache]: Analyzing trace with hash 900894464, now seen corresponding path program 1 times [2020-06-22 11:12:56,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:56,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:12:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:56,688 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2020-06-22 11:12:56,737 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:56,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:56,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:56,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:56,738 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:56,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:56,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:56,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:56,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration13_Lasso [2020-06-22 11:12:56,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:56,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:56,740 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 11:12:56,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:56,745 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 11:12:56,747 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 11:12:56,748 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 11:12:56,750 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 11:12:56,751 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 11:12:56,753 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 11:12:56,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:56,931 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 11:12:56,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:56,933 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 11:12:56,935 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 11:12:56,939 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 11:12:56,940 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 11:12:57,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:57,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:57,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:57,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:57,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:57,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:57,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,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 11:12:57,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:57,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:57,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:57,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:57,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:57,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:57,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,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 11:12:57,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:57,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:57,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:57,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:57,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:57,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:57,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:57,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:57,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:57,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,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 11:12:57,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:57,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:57,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,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 11:12:57,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:57,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:57,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:57,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:57,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:57,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:57,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:57,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:57,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:57,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:57,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:57,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:57,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:57,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:57,216 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:12:57,216 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:12:57,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:57,216 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 11:12:57,216 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:57,216 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2020-06-22 11:12:57,250 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:57,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:57,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 11:12:57,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:57,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:57,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:57,318 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 11:12:57,319 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:57,324 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:57,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:57,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2020-06-22 11:12:57,336 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 11:12:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,411 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:57,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:57,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:57,437 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2020-06-22 11:12:57,438 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:57,442 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:57,443 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:57,443 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2020-06-22 11:12:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,485 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:57,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:57,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:57,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 11:12:57,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:57,548 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2020-06-22 11:12:57,549 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:57,557 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:57,557 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:57,558 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2020-06-22 11:12:57,589 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 11:12:57,590 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 11:12:57,590 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 94 states and 117 transitions. cyclomatic complexity: 28 Second operand 7 states. [2020-06-22 11:12:57,783 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 94 states and 117 transitions. cyclomatic complexity: 28. Second operand 7 states. Result 186 states and 224 transitions. Complement of second has 42 states. [2020-06-22 11:12:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-06-22 11:12:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 11:12:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2020-06-22 11:12:57,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 4 letters. Loop has 11 letters. [2020-06-22 11:12:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 15 letters. Loop has 11 letters. [2020-06-22 11:12:57,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:57,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 64 transitions. Stem has 4 letters. Loop has 22 letters. [2020-06-22 11:12:57,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:12:57,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 224 transitions. [2020-06-22 11:12:57,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 11:12:57,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 131 states and 158 transitions. [2020-06-22 11:12:57,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-06-22 11:12:57,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-06-22 11:12:57,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 158 transitions. [2020-06-22 11:12:57,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:12:57,792 INFO L706 BuchiCegarLoop]: Abstraction has 131 states and 158 transitions. [2020-06-22 11:12:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 158 transitions. [2020-06-22 11:12:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2020-06-22 11:12:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-06-22 11:12:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2020-06-22 11:12:57,795 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 108 transitions. [2020-06-22 11:12:57,795 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 108 transitions. [2020-06-22 11:12:57,795 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 11:12:57,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 108 transitions. [2020-06-22 11:12:57,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 11:12:57,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:12:57,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:12:57,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:12:57,796 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:12:57,796 INFO L794 eck$LassoCheckResult]: Stem: 6500#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 6491#L-1 [186] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 6492#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 6525#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6475#L8-2 [2020-06-22 11:12:57,797 INFO L796 eck$LassoCheckResult]: Loop: 6475#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 6471#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 6472#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6501#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 6488#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6482#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6483#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 6494#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 6496#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 6497#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 6466#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 6467#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6550#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 6473#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 6474#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6502#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 6489#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6484#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6485#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 6495#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 6503#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 6468#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 6470#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 6475#L8-2 [2020-06-22 11:12:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash 4681906, now seen corresponding path program 1 times [2020-06-22 11:12:57,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:57,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:57,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1761686308, now seen corresponding path program 1 times [2020-06-22 11:12:57,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:57,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:57,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash -194016429, now seen corresponding path program 1 times [2020-06-22 11:12:57,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:12:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:12:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:57,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:12:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:12:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:58,093 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2020-06-22 11:12:58,266 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-06-22 11:12:58,322 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:12:58,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:12:58,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:12:58,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:12:58,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:12:58,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:12:58,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:12:58,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:12:58,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Lasso [2020-06-22 11:12:58,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:12:58,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:12:58,324 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 11:12:58,327 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 11:12:58,329 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 11:12:58,331 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 11:12:58,333 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 11:12:58,525 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 11:12:58,527 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 11:12:58,529 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 11:12:58,530 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 11:12:58,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:12:58,536 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 11:12:58,538 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 11:12:58,540 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 11:12:58,542 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 11:12:58,830 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:12:58,831 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:12:58,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:58,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:58,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:58,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:58,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,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 11:12:58,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:58,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,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 11:12:58,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:58,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:58,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:58,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,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 11:12:58,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:58,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:58,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:58,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,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 11:12:58,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:12:58,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:12:58,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:12:58,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:12:58,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:12:58,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:12:58,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:12:58,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:12:58,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:12:58,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:12:58,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:12:58,877 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:12:58,884 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 11:12:58,884 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 11:12:58,885 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:12:58,885 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:12:58,885 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:12:58,886 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 Supporting invariants [] [2020-06-22 11:12:58,912 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:12:58,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:12:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:12:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:58,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:12:58,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:58,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:58,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,044 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 35 treesize of output 19 [2020-06-22 11:12:59,045 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,052 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,052 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,052 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,073 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 21 treesize of output 20 [2020-06-22 11:12:59,074 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,081 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,082 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,082 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:12:59,088 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 23 treesize of output 22 [2020-06-22 11:12:59,088 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,098 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 11:12:59,098 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:12:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 11:12:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,219 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 35 treesize of output 19 [2020-06-22 11:12:59,219 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,228 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,228 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,233 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 21 treesize of output 20 [2020-06-22 11:12:59,233 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,240 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,241 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,241 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:12:59,251 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 23 treesize of output 22 [2020-06-22 11:12:59,251 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,260 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 11:12:59,260 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:12:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,307 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 16 [2020-06-22 11:12:59,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,314 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,315 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,315 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:12:59,340 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 21 treesize of output 20 [2020-06-22 11:12:59,340 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,347 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,347 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,347 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2020-06-22 11:12:59,357 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 23 treesize of output 22 [2020-06-22 11:12:59,357 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,365 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,366 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 11:12:59,366 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-06-22 11:12:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:12:59,463 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:12:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,481 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 19 treesize of output 18 [2020-06-22 11:12:59,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,488 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,488 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,489 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:12 [2020-06-22 11:12:59,498 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 21 treesize of output 20 [2020-06-22 11:12:59,499 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,505 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,505 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 11:12:59,506 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:12:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,556 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 23 [2020-06-22 11:12:59,556 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,564 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,564 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,564 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:12:59,570 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 35 treesize of output 19 [2020-06-22 11:12:59,570 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,577 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,577 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,577 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,598 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 23 [2020-06-22 11:12:59,598 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,607 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,607 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,607 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:12:59,613 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 35 treesize of output 19 [2020-06-22 11:12:59,614 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,621 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,622 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,622 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,626 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 21 treesize of output 20 [2020-06-22 11:12:59,627 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,634 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,634 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 11:12:59,634 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:12:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,654 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 23 [2020-06-22 11:12:59,654 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,663 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,663 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:12:59,668 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 35 treesize of output 19 [2020-06-22 11:12:59,668 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,675 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,675 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,676 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,680 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 21 treesize of output 20 [2020-06-22 11:12:59,680 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,687 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,687 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 11:12:59,687 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:12:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,706 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 21 treesize of output 20 [2020-06-22 11:12:59,706 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,712 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,712 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,712 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2020-06-22 11:12:59,721 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 16 [2020-06-22 11:12:59,721 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,727 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,727 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,728 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:12:59,731 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 21 treesize of output 20 [2020-06-22 11:12:59,732 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,737 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,737 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 11:12:59,738 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 11:12:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,756 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 21 treesize of output 20 [2020-06-22 11:12:59,757 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,763 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,763 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,764 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2020-06-22 11:12:59,773 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 16 [2020-06-22 11:12:59,773 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,779 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,779 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,779 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:12:59,783 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 21 treesize of output 20 [2020-06-22 11:12:59,783 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,789 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,789 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 11:12:59,789 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 11:12:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,811 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 35 treesize of output 19 [2020-06-22 11:12:59,811 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,818 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,819 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,819 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,822 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 21 treesize of output 20 [2020-06-22 11:12:59,823 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,831 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,831 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,831 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:12:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:12:59,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:12:59,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:12:59,856 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 35 treesize of output 19 [2020-06-22 11:12:59,856 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,864 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,865 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,865 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:12:59,869 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 21 treesize of output 20 [2020-06-22 11:12:59,869 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,876 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,877 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,877 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:12:59,882 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 23 treesize of output 22 [2020-06-22 11:12:59,883 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:12:59,890 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:12:59,891 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 11:12:59,891 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:12:59,892 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 11:12:59,892 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 11:12:59,892 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 108 transitions. cyclomatic complexity: 26 Second operand 8 states. [2020-06-22 11:13:00,652 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 108 transitions. cyclomatic complexity: 26. Second operand 8 states. Result 752 states and 866 transitions. Complement of second has 142 states. [2020-06-22 11:13:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 4 stem states 17 non-accepting loop states 2 accepting loop states [2020-06-22 11:13:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 11:13:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 166 transitions. [2020-06-22 11:13:00,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 166 transitions. Stem has 4 letters. Loop has 23 letters. [2020-06-22 11:13:00,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:00,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 166 transitions. Stem has 27 letters. Loop has 23 letters. [2020-06-22 11:13:00,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:00,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 166 transitions. Stem has 4 letters. Loop has 46 letters. [2020-06-22 11:13:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:00,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 866 transitions. [2020-06-22 11:13:00,664 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 114 [2020-06-22 11:13:00,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 288 states and 339 transitions. [2020-06-22 11:13:00,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-06-22 11:13:00,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-06-22 11:13:00,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 339 transitions. [2020-06-22 11:13:00,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:13:00,666 INFO L706 BuchiCegarLoop]: Abstraction has 288 states and 339 transitions. [2020-06-22 11:13:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 339 transitions. [2020-06-22 11:13:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 86. [2020-06-22 11:13:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-06-22 11:13:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2020-06-22 11:13:00,670 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 107 transitions. [2020-06-22 11:13:00,670 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 107 transitions. [2020-06-22 11:13:00,670 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 11:13:00,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 107 transitions. [2020-06-22 11:13:00,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 11:13:00,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:13:00,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:13:00,671 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:13:00,671 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:13:00,671 INFO L794 eck$LassoCheckResult]: Stem: 8340#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 8330#L-1 [185] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 8331#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 8352#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8313#L8-2 [2020-06-22 11:13:00,672 INFO L796 eck$LassoCheckResult]: Loop: 8313#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 8309#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8310#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8341#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 8326#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8321#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8322#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 8335#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 8333#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 8334#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 8304#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 8305#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8319#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 8311#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 8312#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8342#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 8327#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8328#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 8336#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 8337#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 8343#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 8306#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 8308#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 8313#L8-2 [2020-06-22 11:13:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash 4680945, now seen corresponding path program 1 times [2020-06-22 11:13:00,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:13:00,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:13:00,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:00,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:13:00,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1761686308, now seen corresponding path program 2 times [2020-06-22 11:13:00,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:13:00,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:13:00,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:00,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:13:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash -225036236, now seen corresponding path program 1 times [2020-06-22 11:13:00,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:13:00,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:13:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:00,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:13:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:00,948 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2020-06-22 11:13:01,098 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-06-22 11:13:01,146 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:13:01,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:13:01,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:13:01,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:13:01,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:13:01,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:13:01,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:13:01,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:13:01,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Lasso [2020-06-22 11:13:01,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:13:01,147 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:13:01,149 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 11:13:01,151 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 11:13:01,153 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 11:13:01,154 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 11:13:01,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 11:13:01,353 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 11:13:01,356 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 11:13:01,357 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 11:13:01,359 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 11:13:01,361 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 11:13:01,363 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 11:13:01,365 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 11:13:01,367 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 11:13:01,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:01,372 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 11:13:01,623 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:13:01,624 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:13:01,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 11:13:01,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:01,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:01,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:01,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:01,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:01,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:01,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:01,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:01,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:01,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:01,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:01,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:01,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:01,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:01,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:01,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:01,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 11:13:01,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:01,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:01,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:01,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:01,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:01,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:01,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:01,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:01,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:01,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:01,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:01,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:01,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:01,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:01,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:01,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:01,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:01,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 11:13:01,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:01,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:01,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:01,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:01,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:01,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:01,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:01,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:01,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:01,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:01,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:01,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:01,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:01,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:01,646 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:13:01,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 11:13:01,649 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:13:01,649 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:13:01,650 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:13:01,650 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:13:01,650 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9 Supporting invariants [] [2020-06-22 11:13:01,682 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 11:13:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:13:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:01,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:13:01,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:01,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:01,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:01,811 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 35 treesize of output 19 [2020-06-22 11:13:01,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:01,820 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:01,821 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:01,821 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:01,845 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 21 treesize of output 20 [2020-06-22 11:13:01,846 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:01,855 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:01,855 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:01,855 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:01,862 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 23 treesize of output 22 [2020-06-22 11:13:01,862 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:01,871 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:01,872 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 11:13:01,872 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:13:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 11:13:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:01,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:01,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:01,997 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 35 treesize of output 19 [2020-06-22 11:13:01,998 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,005 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,005 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,006 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:02,010 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 21 treesize of output 20 [2020-06-22 11:13:02,011 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,018 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,019 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,019 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:02,024 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 23 treesize of output 22 [2020-06-22 11:13:02,025 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,034 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,034 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 11:13:02,034 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:13:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,076 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 16 [2020-06-22 11:13:02,076 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,083 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,083 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,083 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:13:02,106 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 21 treesize of output 20 [2020-06-22 11:13:02,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,113 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,113 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,113 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2020-06-22 11:13:02,118 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 23 treesize of output 22 [2020-06-22 11:13:02,119 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,125 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,125 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 11:13:02,126 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-06-22 11:13:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:02,204 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,221 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 19 treesize of output 18 [2020-06-22 11:13:02,221 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,227 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,228 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:12 [2020-06-22 11:13:02,238 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 21 treesize of output 20 [2020-06-22 11:13:02,238 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,245 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,245 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 11:13:02,245 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 [2020-06-22 11:13:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,299 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 23 [2020-06-22 11:13:02,299 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,308 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,308 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,308 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:13:02,314 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 35 treesize of output 19 [2020-06-22 11:13:02,315 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,322 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,323 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,323 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,349 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 23 [2020-06-22 11:13:02,349 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,357 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,358 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,358 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:13:02,364 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 35 treesize of output 19 [2020-06-22 11:13:02,364 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,372 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,372 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,373 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:02,377 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 21 treesize of output 20 [2020-06-22 11:13:02,378 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,385 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 11:13:02,385 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,407 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 23 [2020-06-22 11:13:02,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,417 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,417 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,418 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:13:02,424 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 35 treesize of output 19 [2020-06-22 11:13:02,424 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,433 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,433 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:02,438 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 21 treesize of output 20 [2020-06-22 11:13:02,439 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,448 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,448 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 11:13:02,448 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,473 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 21 treesize of output 20 [2020-06-22 11:13:02,473 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,481 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,481 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,482 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2020-06-22 11:13:02,493 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 16 [2020-06-22 11:13:02,493 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,502 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,503 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:13:02,507 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 21 treesize of output 20 [2020-06-22 11:13:02,508 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,516 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,516 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 11:13:02,516 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 11:13:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,543 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 21 treesize of output 20 [2020-06-22 11:13:02,544 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,551 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,552 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,552 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2020-06-22 11:13:02,563 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 16 [2020-06-22 11:13:02,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,571 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,571 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,572 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 11:13:02,576 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 21 treesize of output 20 [2020-06-22 11:13:02,577 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,584 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,584 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 11:13:02,584 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 11:13:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,610 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 35 treesize of output 19 [2020-06-22 11:13:02,611 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,620 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,620 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,620 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:02,625 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 21 treesize of output 20 [2020-06-22 11:13:02,626 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,636 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,636 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,636 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:02,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:02,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:02,663 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 35 treesize of output 19 [2020-06-22 11:13:02,664 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,672 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,673 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,673 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:02,683 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 21 treesize of output 20 [2020-06-22 11:13:02,684 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,696 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,696 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,696 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:02,703 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 23 treesize of output 22 [2020-06-22 11:13:02,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:02,712 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:02,713 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 11:13:02,713 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:13:02,714 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 11:13:02,714 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 11:13:02,714 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 107 transitions. cyclomatic complexity: 25 Second operand 8 states. [2020-06-22 11:13:03,381 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 107 transitions. cyclomatic complexity: 25. Second operand 8 states. Result 551 states and 635 transitions. Complement of second has 105 states. [2020-06-22 11:13:03,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 4 stem states 17 non-accepting loop states 2 accepting loop states [2020-06-22 11:13:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 11:13:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 138 transitions. [2020-06-22 11:13:03,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 138 transitions. Stem has 4 letters. Loop has 23 letters. [2020-06-22 11:13:03,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:03,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 138 transitions. Stem has 27 letters. Loop has 23 letters. [2020-06-22 11:13:03,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:03,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 138 transitions. Stem has 4 letters. Loop has 46 letters. [2020-06-22 11:13:03,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:03,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 635 transitions. [2020-06-22 11:13:03,392 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2020-06-22 11:13:03,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 196 states and 230 transitions. [2020-06-22 11:13:03,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 11:13:03,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-06-22 11:13:03,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 230 transitions. [2020-06-22 11:13:03,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 11:13:03,394 INFO L706 BuchiCegarLoop]: Abstraction has 196 states and 230 transitions. [2020-06-22 11:13:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 230 transitions. [2020-06-22 11:13:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 86. [2020-06-22 11:13:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-06-22 11:13:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2020-06-22 11:13:03,396 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2020-06-22 11:13:03,396 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2020-06-22 11:13:03,396 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2020-06-22 11:13:03,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 106 transitions. [2020-06-22 11:13:03,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-22 11:13:03,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:13:03,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:13:03,398 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 11:13:03,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:13:03,398 INFO L794 eck$LassoCheckResult]: Stem: 9940#ULTIMATE.startENTRY [120] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9930#L-1 [184] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 9931#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9953#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9913#L8-2 [2020-06-22 11:13:03,399 INFO L796 eck$LassoCheckResult]: Loop: 9913#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 9909#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9910#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9941#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 9926#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9921#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9922#L10 [205] L10-->L11: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet6_3|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 9933#L11 [122] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_4|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 9936#L11-1 [253] L11-1-->L12: Formula: (and (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 (+ |v_ULTIMATE.start_main_#t~mem7_6| (- 1))))) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~x~0.base_25)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_31| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_31|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 9937#L12 [256] L12-->L17-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18 |v_ULTIMATE.start_main_#t~nondet8_5|)) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_34| v_ULTIMATE.start_main_~y~0.base_24)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} OutVars{#valid=|v_#valid_45|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8, #memory_int] 9904#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9905#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9919#L8-2 [114] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 9911#L8-3 [111] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 9912#L8-4 [199] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9942#L8-6 [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 9943#L9 [135] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9977#L9-1 [130] L9-1-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 9934#L10 [99] L10-->L14: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet6_5|) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6] 9935#L14 [108] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~y~0.base_10)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8) |v_ULTIMATE.start_main_#t~mem9_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8) (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_16| v_ULTIMATE.start_main_~y~0.base_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 9944#L14-1 [252] L14-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~y~0.base_22)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_30| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 9906#L17-2 [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 9908#L8-1 [193] L8-1-->L8-2: Formula: (and (> |v_ULTIMATE.start_main_#t~mem2_3| 0) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 9913#L8-2 [2020-06-22 11:13:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash 4679984, now seen corresponding path program 1 times [2020-06-22 11:13:03,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:13:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:13:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:03,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:13:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1761686308, now seen corresponding path program 3 times [2020-06-22 11:13:03,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:13:03,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:13:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:03,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:13:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -256056043, now seen corresponding path program 1 times [2020-06-22 11:13:03,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:13:03,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:13:03,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:03,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:13:03,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:13:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:03,684 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2020-06-22 11:13:03,854 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2020-06-22 11:13:03,906 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:13:03,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:13:03,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:13:03,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:13:03,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:13:03,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:13:03,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:13:03,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:13:03,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Lasso [2020-06-22 11:13:03,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:13:03,907 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:13:03,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,914 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 11:13:03,919 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 11:13:03,921 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 11:13:03,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,924 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 11:13:03,926 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 11:13:03,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 11:13:03,934 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 11:13:03,936 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 11:13:04,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:13:04,370 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:13:04,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 11:13:04,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:04,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:04,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:04,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:04,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:04,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:04,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:04,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:04,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:04,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:04,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:04,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 11:13:04,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:13:04,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:13:04,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:13:04,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:04,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:04,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:04,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:04,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:13:04,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 11:13:04,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:13:04,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:13:04,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:13:04,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:13:04,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:13:04,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:13:04,441 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:13:04,446 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 11:13:04,446 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 11:13:04,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:13:04,447 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-06-22 11:13:04,447 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:13:04,461 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem2) = 1*ULTIMATE.start_main_#t~mem2 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10 + 1*ULTIMATE.start_main_#t~mem2 >= 0, 2*ULTIMATE.start_main_#t~mem2 - 1 >= 0] [2020-06-22 11:13:04,497 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 11:13:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:13:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:04,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 11:13:04,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:04,548 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 11:13:04,549 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,553 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,553 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,553 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2020-06-22 11:13:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:04,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 11:13:04,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:04,650 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 35 treesize of output 19 [2020-06-22 11:13:04,651 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:04,682 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 21 treesize of output 20 [2020-06-22 11:13:04,682 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,690 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,690 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,690 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:04,695 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 23 treesize of output 22 [2020-06-22 11:13:04,696 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,704 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,704 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 11:13:04,705 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:13:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 11:13:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:04,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 11:13:04,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:04,915 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 35 treesize of output 19 [2020-06-22 11:13:04,916 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,925 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,925 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,926 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:04,930 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 21 treesize of output 20 [2020-06-22 11:13:04,931 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,939 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,940 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,940 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:04,946 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 23 treesize of output 22 [2020-06-22 11:13:04,947 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:04,956 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:04,956 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 11:13:04,956 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:13:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:04,976 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:04,994 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,012 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,030 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,044 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:05,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:13:05,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:05,096 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 21 treesize of output 20 [2020-06-22 11:13:05,097 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,105 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,105 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,105 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2020-06-22 11:13:05,140 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 16 [2020-06-22 11:13:05,141 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,149 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,150 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,150 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2020-06-22 11:13:05,155 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 21 treesize of output 20 [2020-06-22 11:13:05,156 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,165 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,165 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 11:13:05,165 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:05,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 11:13:05,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:05,190 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 23 [2020-06-22 11:13:05,191 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,199 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:13:05,205 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 35 treesize of output 19 [2020-06-22 11:13:05,205 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,212 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,213 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,213 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:05,217 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 21 treesize of output 20 [2020-06-22 11:13:05,217 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,225 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,225 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 11:13:05,225 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:05,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 11:13:05,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:05,246 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 23 [2020-06-22 11:13:05,246 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,255 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,255 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,255 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2020-06-22 11:13:05,260 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 35 treesize of output 19 [2020-06-22 11:13:05,261 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,269 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,270 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 11:13:05,274 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 21 treesize of output 20 [2020-06-22 11:13:05,275 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,283 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 11:13:05,284 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,300 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,313 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,326 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:13:05,340 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:13:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:13:05,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 11:13:05,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:13:05,361 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 16 [2020-06-22 11:13:05,361 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,369 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,369 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,369 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2020-06-22 11:13:05,374 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 21 treesize of output 20 [2020-06-22 11:13:05,374 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,382 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,382 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,382 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2020-06-22 11:13:05,387 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 23 treesize of output 22 [2020-06-22 11:13:05,388 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:13:05,396 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:13:05,396 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 11:13:05,396 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2020-06-22 11:13:05,397 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 11:13:05,398 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 10 loop predicates [2020-06-22 11:13:05,398 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 86 states and 106 transitions. cyclomatic complexity: 24 Second operand 10 states. [2020-06-22 11:13:05,798 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 86 states and 106 transitions. cyclomatic complexity: 24. Second operand 10 states. Result 180 states and 213 transitions. Complement of second has 34 states. [2020-06-22 11:13:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 3 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 11:13:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 11:13:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2020-06-22 11:13:05,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 23 letters. [2020-06-22 11:13:05,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:05,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 27 letters. Loop has 23 letters. [2020-06-22 11:13:05,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:05,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 54 transitions. Stem has 4 letters. Loop has 46 letters. [2020-06-22 11:13:05,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:13:05,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 213 transitions. [2020-06-22 11:13:05,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:13:05,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2020-06-22 11:13:05,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 11:13:05,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 11:13:05,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 11:13:05,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:13:05,807 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:13:05,807 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:13:05,807 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:13:05,807 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2020-06-22 11:13:05,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:13:05,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:13:05,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 11:13:05,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:13:05 BasicIcfg [2020-06-22 11:13:05,814 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 11:13:05,814 INFO L168 Benchmark]: Toolchain (without parser) took 26906.85 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 462.4 MB). Free memory was 565.2 MB in the beginning and 768.5 MB in the end (delta: -203.3 MB). Peak memory consumption was 259.2 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,815 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 11:13:05,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.91 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 565.2 MB in the beginning and 655.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.73 ms. Allocated memory is still 690.5 MB. Free memory was 655.4 MB in the beginning and 653.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,816 INFO L168 Benchmark]: Boogie Preprocessor took 23.56 ms. Allocated memory is still 690.5 MB. Free memory was 653.3 MB in the beginning and 652.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,816 INFO L168 Benchmark]: RCFGBuilder took 356.01 ms. Allocated memory is still 690.5 MB. Free memory was 652.2 MB in the beginning and 625.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,817 INFO L168 Benchmark]: BlockEncodingV2 took 159.28 ms. Allocated memory is still 690.5 MB. Free memory was 625.7 MB in the beginning and 614.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,817 INFO L168 Benchmark]: TraceAbstraction took 1191.19 ms. Allocated memory is still 690.5 MB. Free memory was 613.8 MB in the beginning and 492.8 MB in the end (delta: 121.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,817 INFO L168 Benchmark]: BuchiAutomizer took 24828.33 ms. Allocated memory was 690.5 MB in the beginning and 1.1 GB in the end (delta: 421.5 MB). Free memory was 491.7 MB in the beginning and 768.5 MB in the end (delta: -276.8 MB). Peak memory consumption was 144.7 MB. Max. memory is 50.3 GB. [2020-06-22 11:13:05,820 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 58 locations, 63 edges - StatisticsResult: Encoded RCFG 48 locations, 86 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 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 302.91 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 565.2 MB in the beginning and 655.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.73 ms. Allocated memory is still 690.5 MB. Free memory was 655.4 MB in the beginning and 653.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.56 ms. Allocated memory is still 690.5 MB. Free memory was 653.3 MB in the beginning and 652.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 356.01 ms. Allocated memory is still 690.5 MB. Free memory was 652.2 MB in the beginning and 625.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 159.28 ms. Allocated memory is still 690.5 MB. Free memory was 625.7 MB in the beginning and 614.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1191.19 ms. Allocated memory is still 690.5 MB. Free memory was 613.8 MB in the beginning and 492.8 MB in the end (delta: 121.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 24828.33 ms. Allocated memory was 690.5 MB in the beginning and 1.1 GB in the end (delta: 421.5 MB). Free memory was 491.7 MB in the beginning and 768.5 MB in the end (delta: -276.8 MB). Peak memory consumption was 144.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-06-22 11:13:05,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:13:05,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:13:05,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:13:05,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid[y] == 1 && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 26 error locations. SAFE Result, 1.1s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 276 SDslu, 4 SDs, 0 SdLazy, 262 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (6 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 20 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 43 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 23 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 23 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@751eeec5 and consists of 13 locations. 6 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.7s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 9.8s. Construction of modules took 2.7s. Büchi inclusion checks took 11.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 208 states and ocurred in iteration 10. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/27 HoareTripleCheckerStatistics: 344 SDtfs, 1525 SDslu, 1331 SDs, 0 SdLazy, 3283 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital161 mio100 ax100 hnf100 lsp93 ukn79 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 11:12:35.719 ----------------------------------------------- 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 11:13:06.073 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check